The minimum spectral radius of graphs with a given clique number.
Stevanović, Dragan, Hansen, Pierre (2008)
ELA. The Electronic Journal of Linear Algebra [electronic only]
Similarity:
Stevanović, Dragan, Hansen, Pierre (2008)
ELA. The Electronic Journal of Linear Algebra [electronic only]
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.
Lihua Feng, Guihai Yu (2009)
Publications de l'Institut Mathématique
Similarity:
Dragoš Cvetković (2012)
The Yugoslav Journal of Operations Research
Similarity:
Richard A. Brualdi, Ernie S. Solheid (1986)
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...
Lihua You, Yujie Shu, Xiao-Dong Zhang (2016)
Czechoslovak Mathematical Journal
Similarity:
We obtain a sharp upper bound for the spectral radius of a nonnegative matrix. This result is used to present upper bounds for the adjacency spectral radius, the Laplacian spectral radius, the signless Laplacian spectral radius, the distance spectral radius, the distance Laplacian spectral radius, the distance signless Laplacian spectral radius of an undirected graph or a digraph. These results are new or generalize some known results.
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.
Juan Alberto Rodríguez-Velazquez, Jose Maria Sigarreta Almira (2007)
Discussiones Mathematicae Graph Theory
Similarity:
In this paper we obtain several tight bounds on different types of alliance numbers of a graph, namely (global) defensive alliance number, global offensive alliance number and global dual alliance number. In particular, we investigate the relationship between the alliance numbers of a graph and its algebraic connectivity, its spectral radius, and its Laplacian spectral radius.
Marianna Bolla, Ahmed Elbanna (2016)
Special Matrices
Similarity:
We will discuss how graph based matrices are capable to find classification of the graph vertices with small within- and between-cluster discrepancies. The structural eigenvalues together with the corresponding spectral subspaces of the normalized modularity matrix are used to find a block-structure in the graph. The notions are extended to rectangular arrays of nonnegative entries and to directed graphs. We also investigate relations between spectral properties, multiway discrepancies,...
D. M. Cvetković, I. Gutman (1975)
Publications de l'Institut Mathématique
Similarity:
Daisuke Igarashi, Nobuaki Obata (2006)
Banach Center Publications
Similarity:
Two new examples are given for illustrating the method of quantum decomposition in the asymptotic spectral analysis for a growing family of graphs. The odd graphs form a growing family of distance-regular graphs and the two-sided Rayleigh distribution appears in the limit of vacuum spectral distribution of the adjacency matrix. For a spidernet as well as for a growing family of spidernets the vacuum distribution of the adjacency matrix is the free Meixner law. These distributions are...