The search session has expired. Please query the service again.

The search session has expired. Please query the service again.

Displaying similar documents to “The signless Laplacian spectral radius of graphs with given number of cut vertices”

The Minimum Spectral Radius of Signless Laplacian of Graphs with a Given Clique Number

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.

Partitions of networks that are robust to vertex permutation dynamics

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

Spectral study of alliances in graphs

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.

The (signless) Laplacian spectral radius of unicyclic and bicyclic graphs with n vertices and k pendant vertices

Muhuo Liu, Xuezhong Tan, Bo Lian Liu (2010)

Czechoslovak Mathematical Journal

Similarity:

In this paper, the effects on the signless Laplacian spectral radius of a graph are studied when some operations, such as edge moving, edge subdividing, are applied to the graph. Moreover, the largest signless Laplacian spectral radius among the all unicyclic graphs with n vertices and k pendant vertices is identified. Furthermore, we determine the graphs with the largest Laplacian spectral radii among the all unicyclic graphs and bicyclic graphs with n vertices and k pendant vertices,...