Ordering Cacti With $n$ Vertices and $k$ Cycles by Their Laplacian Spectral Radii

Shu-Guang Guo; Yan-Feng Wang

Displaying similar documents to “Ordering Cacti With $n$ Vertices and $k$ Cycles by Their Laplacian Spectral Radii”

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

On the Index of Cactuses With n Vertices

Bojana Borovićanin, Miroslav Petrović (2006)

Publications de l'Institut Mathématique

Similarity:

Laplacian integral graphs with maximum degree 3.

Kirkland, Steve (2008)

The Electronic Journal of Combinatorics [electronic only]

Similarity:

On the index of cactuses with $n$ vertices.

Borovćanin, Bojana, Petrović, Miroslav (2006)

Publications de l'Institut Mathématique. Nouvelle Série

Similarity:

On the index of cactuses with $n$ vertices.

Borovćanin, Bojana, Petrović, Miroslav (2006)

Publications de l'Institut Mathématique. Nouvelle Série

Similarity:

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.

The signless Laplacian spectral radius of graphs with given number of cut vertices

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.

ON THREE CONJECTURES INVOLVING THE SIGNLESS LAPLACIAN SPECTRAL RADIUS OF GRAPHS

Lihua Feng, Guihai Yu (2009)

Publications de l'Institut Mathématique

Similarity:

Minimizing Laplacian spectral radius of unicyclic graphs with fixed girth

Kamal Lochan Patra, Binod Kumar Sahoo (2013)

Czechoslovak Mathematical Journal

Similarity:

In this paper we consider the following problem: Over the class of all simple connected unicyclic graphs on $n$ vertices with girth $g$ ( $n$ , $g$ being fixed), which graph minimizes the Laplacian spectral radius? Let $U_{n, g}$ be the lollipop graph obtained by appending a pendent vertex of a path on $n - g$ $(n > g)$ vertices to a vertex of a cycle on $g \geq 3$ vertices. We prove that the graph $U_{n, g}$ uniquely minimizes the Laplacian spectral radius for $n \geq 2 g - 1$ when $g$ is even and for $n \geq 3 g - 1$ when $g$ is odd.

Selected Topics from the Theory of Graph Energy: Hypoenergetic Graph

Snježana Majstorović, Antoaneta Klobučar, Ivan Gutman (2009)

Zbornik Radova

Similarity:

Displaying similar documents to “Ordering Cacti With n Vertices and k Cycles by Their Laplacian Spectral Radii”

Displaying similar documents to “Ordering Cacti With $n$ Vertices and $k$ Cycles by Their Laplacian Spectral Radii”