Wyniki wyszukiwania

Sortuj według:

Ogranicz wyniki do:

Per-Spectral Characterizations Of Some Bipartite Graphs

100%

Wu T., Zhang H.

Discussiones Mathematicae Graph Theory

2017

tom 37

nr 4

935-951

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 Kp,p with some edges deleted is determined by its permanental spectrum. We first prove that a graph obtained from Kp,p by deleting all edges of a star K1,l, provided l < p, is determined by its permanental spectrum. Furthermore, we show that all graphs with a perfect matching obtained from Kp,p by removing five or fewer edges are determined by their permanental spectra.

Extremal Matching Energy of Complements of Trees

81%

Wu T., Yan W., Zhang H.

Discussiones Mathematicae Graph Theory

2016

tom 36

nr 3

505-521

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, . . . , [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.

Ograniczanie wyników

2 Discussiones Mathematicae Graph Theory

2 Wu T.

2 Zhang H.

1 Yan W.

1 2017

1 2016

Wyniki wyszukiwania

Per-Spectral Characterizations Of Some Bipartite Graphs

Extremal Matching Energy of Complements of Trees