TOWARDS A SPECTRAL THEORY OF GRAPHS BASED ON THE SIGNLESS LAPLACIAN, I
Dragoš Cvetković, Slobodan K. Simić (2009)
Publications de l'Institut Mathématique
Similarity:
Dragoš Cvetković, Slobodan K. Simić (2009)
Publications de l'Institut Mathématique
Similarity:
Lin Cui, Yi-Zheng Fan (2010)
Discussiones Mathematicae Graph Theory
Similarity:
In this paper, we determine the graph with maximal signless Laplacian spectral radius among all connected graphs with fixed order and given number of cut vertices.
Dragoš Cvetković (2012)
The Yugoslav Journal of Operations Research
Similarity:
Li Su, Hong-Hai Li, Jing Zhang (2014)
Discussiones Mathematicae Graph Theory
Similarity:
In this paper we observe that the minimal signless Laplacian spectral radius is obtained uniquely at the kite graph PKn−ω,ω among all connected graphs with n vertices and clique number ω. In addition, we show that the spectral radius μ of PKm,ω (m ≥ 1) satisfies [...] More precisely, for m > 1, μ satisfies the equation [...] where [...] and [...] . At last the spectral radius μ(PK∞,ω) of the infinite graph PK∞,ω is also discussed.
Cioabă, Sebastian M. (2007)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Yi-Zheng Fan, Song Wu (2008)
Discussiones Mathematicae Graph Theory
Similarity:
The spectral radius of a graph is defined by that of its unoriented Laplacian matrix. In this paper, we determine the unicyclic graphs respectively with the third and the fourth largest spectral radius among all unicyclic graphs of given order.
Jianxi Li, Wai Chee Shiu, An Chang (2010)
Czechoslovak Mathematical Journal
Similarity:
The Laplacian spectral radius of a graph is the largest eigenvalue of the associated Laplacian matrix. In this paper, we improve Shi's upper bound for the Laplacian spectral radius of irregular graphs and present some new bounds for the Laplacian spectral radius of some classes of graphs.
Stevanović, Dragan, Hansen, Pierre (2008)
ELA. The Electronic Journal of Linear Algebra [electronic only]
Similarity:
Shu-Guang Guo, Yan-Feng Wang (2012)
Publications de l'Institut Mathématique
Similarity:
Gary Froyland, Eric Kwok (2015)
Special Matrices
Similarity:
Minimum disconnecting cuts of connected graphs provide fundamental information about the connectivity structure of the graph. Spectral methods are well-known as stable and efficient means of finding good solutions to the balanced minimum cut problem. In this paper we generalise the standard balanced bisection problem for static graphs to a new “dynamic balanced bisection problem”, in which the bisecting cut should be minimal when the vertex-labelled graph is subjected to a general sequence...
Das, K.Ch. (2005)
Acta Mathematica Universitatis Comenianae. New Series
Similarity: