Temat: Isomorphism - Katalog OPAC zbiorów

Skocz do pozycji: 1.

Tytuł:: Determining Graphs by the Complementary Spectrum
Autorzy:: Pinheiro, Lucélia K.
Souza, Bruna S.
Trevisan, Vilmar
Powiązania:: https://bibliotekanauki.pl/articles/31562123.pdf
Data publikacji:: 2020-05-01
Wydawca:: Uniwersytet Zielonogórski. Wydział Matematyki, Informatyki i Ekonometrii
Tematy:: graphs
complementary eigenvalues
graph isomorphism
Opis:: The complementary spectrum of a connected graph G is the set of the complementary eigenvalues of the adjacency matrix of G. In this note, we discuss the possibility of representing G using this spectrum. On one hand, we give evidence that this spectrum distinguishes more graphs than other standard graph spectra. On the other hand, we show that it is hard to compute the complementary spectrum. In particular, we see that computing the complementary spectrum is equivalent to finding all connected induced subgraphs.
Źródło:: Discussiones Mathematicae Graph Theory; 2020, 40, 2; 607-620
2083-5892
Pojawia się w:: Discussiones Mathematicae Graph Theory
Dostawca treści:: Biblioteka Nauki

Artykuł

Skocz do pozycji: 2.

Tytuł:: Isomorphic components of Kronecker product of bipartite graphs
Autorzy:: Jha, Pranava
Klavžar, Sandi
Zmazek, Blaž
Powiązania:: https://bibliotekanauki.pl/articles/971945.pdf
Data publikacji:: 1997
Wydawca:: Uniwersytet Zielonogórski. Wydział Matematyki, Informatyki i Ekonometrii
Tematy:: Kronecker product
bipartite graphs
graph isomorphism
Opis:: Weichsel (Proc. Amer. Math. Soc. 13 (1962) 47-52) proved that the Kronecker product of two connected bipartite graphs consists of two connected components. A condition on the factor graphs is presented which ensures that such components are isomorphic. It is demonstrated that several familiar and easily constructible graphs are amenable to that condition. A partial converse is proved for the above condition and it is conjectured that the converse is true in general.
Źródło:: Discussiones Mathematicae Graph Theory; 1997, 17, 2; 301-309
2083-5892
Pojawia się w:: Discussiones Mathematicae Graph Theory
Dostawca treści:: Biblioteka Nauki

Artykuł

Skocz do pozycji: 3.

Tytuł:: Digraphs with isomorphic underlying and domination graphs: connected $UG^c(d)$
Autorzy:: Factor, Kim
Langley, Larry
Powiązania:: https://bibliotekanauki.pl/articles/743665.pdf
Data publikacji:: 2007
Wydawca:: Uniwersytet Zielonogórski. Wydział Matematyki, Informatyki i Ekonometrii
Tematy:: domination graph
domination
graph isomorphism
underlying graph
Opis:: The domination graph of a directed graph has an edge between vertices x and y provided either (x,z) or (y,z) is an arc for every vertex z distinct from x and y. We consider directed graphs D for which the domination graph of D is isomorphic to the underlying graph of D. We demonstrate that the complement of the underlying graph must have k connected components isomorphic to complete graphs, paths, or cycles. A complete characterization of directed graphs where k = 1 is presented.
Źródło:: Discussiones Mathematicae Graph Theory; 2007, 27, 1; 51-67
2083-5892
Pojawia się w:: Discussiones Mathematicae Graph Theory
Dostawca treści:: Biblioteka Nauki

Artykuł

Informacja