An upper bound on the Laplacian spectral radius of the signed graphs

2008 ◽  
Vol 28 (2) ◽  
pp. 345 ◽  
Author(s):  
Hong-Hai Li ◽  
Jiong Sheng Li
2011 ◽  
Vol 03 (02) ◽  
pp. 185-191 ◽  
Author(s):  
YA-HONG CHEN ◽  
RONG-YING PAN ◽  
XIAO-DONG ZHANG

The signless Laplacian matrix of a graph is the sum of its degree diagonal and adjacency matrices. In this paper, we present a sharp upper bound for the spectral radius of the adjacency matrix of a graph. Then this result and other known results are used to obtain two new sharp upper bounds for the signless Laplacian spectral radius. Moreover, the extremal graphs which attain an upper bound are characterized.


2013 ◽  
Vol 2013 ◽  
pp. 1-9 ◽  
Author(s):  
Haizhou Song ◽  
Qiufen Wang

We study the properties of the eigenvector corresponding to the Laplacian spectral radius of a graph and show some applications. We obtain some results on the Laplacian spectral radius of a graph by grafting and adding edges. We also determine the structure of the maximal Laplacian spectrum tree among trees withnvertices andkpendant vertices (n,kfixed), and the upper bound of the Laplacian spectral radius of some trees.


2019 ◽  
Vol 35 (1) ◽  
pp. 31-40 ◽  
Author(s):  
BILAL A. CHAT ◽  
◽  
HILAL A. GANIE ◽  
S. PIRZADA ◽  
◽  
...  

We consider the skew Laplacian matrix of a digraph −→G obtained by giving an arbitrary direction to the edges of a graph G having n vertices and m edges. We obtain an upper bound for the skew Laplacian spectral radius in terms of the adjacency and the signless Laplacian spectral radius of the underlying graph G. We also obtain upper bounds for the skew Laplacian spectral radius and skew spectral radius, in terms of various parameters associated with the structure of the digraph −→G and characterize the extremal graphs.


10.37236/670 ◽  
2011 ◽  
Vol 18 (1) ◽  
Author(s):  
Ke Li ◽  
Ligong Wang ◽  
Guopeng Zhao

Let $\mathcal{U}(n,g)$ and $\mathcal{B}(n,g)$ be the set of unicyclic graphs and bicyclic graphs on $n$ vertices with girth $g$, respectively. Let $\mathcal{B}_{1}(n,g)$ be the subclass of $\mathcal{B}(n,g)$ consisting of all bicyclic graphs with two edge-disjoint cycles and $\mathcal{B}_{2}(n,g)=\mathcal{B}(n,g)\backslash\mathcal{B}_{1}(n,g)$. This paper determines the unique graph with the maximal signless Laplacian spectral radius among all graphs in $\mathcal{U}(n,g)$ and $\mathcal{B}(n,g)$, respectively. Furthermore, an upper bound of the signless Laplacian spectral radius and the extremal graph for $\mathcal{B}(n,g)$ are also given.


2009 ◽  
Vol 309 (21) ◽  
pp. 6318-6321 ◽  
Author(s):  
Mei Lu ◽  
Huiqing Liu ◽  
Feng Tian

Sign in / Sign up

Export Citation Format

Share Document