Autor: Wu, Tingzeng - Katalog OPAC zbiorów

Skocz do pozycji: 1.

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ł

Skocz do pozycji: 2.

Tytuł:: Extremal Matching Energy of Complements of Trees
Autorzy:: Wu, Tingzeng
Yan, Weigen
Zhang, Heping
Powiązania:: https://bibliotekanauki.pl/articles/31340889.pdf
Data publikacji:: 2016-08-01
Wydawca:: Uniwersytet Zielonogórski. Wydział Matematyki, Informatyki i Ekonometrii
Tematy:: matching polynomial
matching energy
Hosoya index
energy
Opis:: Gutman and Wagner proposed the concept of the matching energy which is defined as the sum of the absolute values of the zeros of the matching polynomial of a graph. And they pointed out that the chemical applications of matching energy go back to the 1970s. Let $T$ be a tree with n vertices. In this paper, we characterize the trees whose complements have the maximal, second-maximal and minimal matching energy. Furthermore, we determine the trees with edge-independence number p whose complements have the minimum matching energy for $ p = 1, 2, . . ., \floor{ n/2 } $. When we restrict our consideration to all trees with a perfect matching, we determine the trees whose complements have the second-maximal matching energy.
Źródło:: Discussiones Mathematicae Graph Theory; 2016, 36, 3; 505-521
2083-5892
Pojawia się w:: Discussiones Mathematicae Graph Theory
Dostawca treści:: Biblioteka Nauki

Artykuł

Informacja