Minimizing Laplacian spectral radius of unicyclic graphs with fixed girth

Details Minimizing Laplacian spectral radius of unicyclic graphs with fixed girth Minimizing Laplacian spectral radius of unicyclic graphs with fixed girth

2010-12-04

arxiv.org/abs/1012.0888v2

Mathematics

Combinatorics

12 pages

Scientific paper

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? We prove that the graph
$U_{n,g}$ (defined in Section 1) uniquely minimizes the Laplacian spectral
radius for $n\geq 2g-1$ when $g$ is even and for $n\geq 3g-1$ when $g$ is odd.

Affiliated with

Also associated with

No associations

Rating

Minimizing Laplacian spectral radius of unicyclic graphs with fixed girth does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Minimizing Laplacian spectral radius of unicyclic graphs with fixed girth, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Minimizing Laplacian spectral radius of unicyclic graphs with fixed girth will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-99200