Temat: permanental polynomial - Katalog OPAC zbiorów

Skocz do pozycji: 1.

Tytuł:: A Note on the Permanental Roots of Bipartite Graphs
Autorzy:: Zhang, Heping
Liu, Shunyi
Li, Wei
Powiązania:: https://bibliotekanauki.pl/articles/30147218.pdf
Data publikacji:: 2014-02-01
Wydawca:: Uniwersytet Zielonogórski. Wydział Matematyki, Informatyki i Ekonometrii
Tematy:: permanent
permanental polynomial
permanental roots
Opis:: It is well-known that any graph has all real eigenvalues and a graph is bipartite if and only if its spectrum is symmetric with respect to the origin. We are interested in finding whether the permanental roots of a bipartite graph G have symmetric property as the spectrum of G. In this note, we show that the permanental roots of bipartite graphs are symmetric with respect to the real and imaginary axes. Furthermore, we prove that any graph has no negative real permanental root, and any graph containing at least one edge has complex permanental roots.
Źródło:: Discussiones Mathematicae Graph Theory; 2014, 34, 1; 49-56
2083-5892
Pojawia się w:: Discussiones Mathematicae Graph Theory
Dostawca treści:: Biblioteka Nauki

Artykuł

Skocz do pozycji: 2.

Tytuł:: The Graphs Whose Permanental Polynomials Are Symmetric
Autorzy:: Li, Wei
Powiązania:: https://bibliotekanauki.pl/articles/31342428.pdf
Data publikacji:: 2018-02-01
Wydawca:: Uniwersytet Zielonogórski. Wydział Matematyki, Informatyki i Ekonometrii
Tematy:: permanental polynomial
rooted product
matching
Opis:: The permanental polynomial $ \pi (G,x) = \Sigma_{i=0}^n b_i x^{n − i} $ of a graph G is symmetric if $ b_i = b_n−i $ for each $i$. In this paper, we characterize the graphs with symmetric permanental polynomials. Firstly, we introduce the rooted product $ H(K) $ of a graph $ H $ by a graph $ K $, and provide a way to compute the permanental polynomial of the rooted product $ H(K) $. Then we give a sufficient and necessary condition for the symmetric polynomial, and we prove that the permanental polynomial of a graph $ G $ is symmetric if and only if $ G $ is the rooted product of a graph by a path of length one.
Źródło:: Discussiones Mathematicae Graph Theory; 2018, 38, 1; 233-243
2083-5892
Pojawia się w:: Discussiones Mathematicae Graph Theory
Dostawca treści:: Biblioteka Nauki

Artykuł

Skocz do pozycji: 3.

Tytuł:: Per-Spectral Characterizations Of Some Bipartite Graphs
Autorzy:: Wu, Tingzeng
Zhang, Heping
Powiązania:: https://bibliotekanauki.pl/articles/31341599.pdf
Data publikacji:: 2017-11-27
Wydawca:: Uniwersytet Zielonogórski. Wydział Matematyki, Informatyki i Ekonometrii
Tematy:: permanent
permanental polynomial
per-spectrum
cospectral
Opis:: A graph is said to be characterized by its permanental spectrum if there is no other non-isomorphic graph with the same permanental spectrum. In this paper, we investigate when a complete bipartite graph K_p,p with some edges deleted is determined by its permanental spectrum. We first prove that a graph obtained from K_p,p by deleting all edges of a star K_1,l, provided l < p, is determined by its permanental spectrum. Furthermore, we show that all graphs with a perfect matching obtained from K_p,p by removing five or fewer edges are determined by their permanental spectra.
Źródło:: Discussiones Mathematicae Graph Theory; 2017, 37, 4; 935-951
2083-5892
Pojawia się w:: Discussiones Mathematicae Graph Theory
Dostawca treści:: Biblioteka Nauki

Artykuł

Informacja