نتایج جستجو برای: seidel signless laplacian eigenvalues

تعداد نتایج: 31915  

2010
Lihua Feng

In this paper, we study the signless Laplacian spectral radius of bicyclic graphs with given number of pendant vertices and characterize the extremal graphs.

A concept related to the spectrum of a graph is that of energy. The energy E(G) of a graph G is equal to the sum of the absolute values of the eigenvalues of the adjacency matrix of G . The Laplacian energy of a graph G is equal to the sum of distances of the Laplacian eigenvalues of G and the average degree d(G) of G. In this paper we introduce the concept of Laplacian energy of fuzzy graphs. ...

2015
Muhuo Liu Bolian Liu Fuyi Wei MUHUO LIU BOLIAN LIU FUYI WEI

Let S(n, c) = K1∨(cK2∪(n−2c−1)K1), where n ≥ 2c+1 and c ≥ 0. In this paper, S(n, c) and its complement are shown to be determined by their Laplacian spectra, respectively. Moreover, we also prove that S(n, c) and its complement are determined by their signless Laplacian spectra, respectively.

2013
DOMINGOS M. CARDOSO ENIDE A. MARTINS MARIA ROBBIANO

The spectrum of the Laplacian, signless Laplacian and adjacency matrices of the family of the weighted graphs R{H}, obtained from a connected weighted graph R on r vertices and r copies of a modified Bethe tree H by identifying the root of the i-th copy of H with the i-th vertex of R, is determined.

2011
MUHUO LIU BOLIAN LIU FUYI WEI

Let S(n, c) = K1∨(cK2∪(n−2c−1)K1), where n ≥ 2c+1 and c ≥ 0. In this paper, S(n, c) and its complement are shown to be determined by their Laplacian spectra, respectively. Moreover, we also prove that S(n, c) and its complement are determined by their signless Laplacian spectra, respectively.

2007
Clemens Brand Barry Guiduli Wilfried Imrich

Among all trivalent graphs on n vertices, let Gn be one with the smallest possible eigenvalue gap. (The eigenvalue gap is the difference between the two largest eigenvalues of the adjacency matrix; for regular graphs, it equals the second smallest eigenvalue of the Laplacian matrix.) We show that Gn is unique for each n and has maximum diameter. This extends work of Guiduli and solves a conject...

2012
CHANGJIANG BU LIZHU SUN JIANG ZHOU YIMIN WEI

Let G be a weighted graph with Laplacian matrix L and signless Laplacian matrix Q. In this note, block representations for the group inverse of L and Q are given. The resistance distance in a graph can be obtained from the block representation of the group inverse of L.

نمودار تعداد نتایج جستجو در هر سال

با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید