Displaying similar documents to “On eigenvectors of mixed graphs with exactly one nonsingular cycle”

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 3 vertices. We prove that the graph U n , g uniquely minimizes the Laplacian spectral radius for n 2 g - 1 when g is even and for n 3 g - 1 when g is odd.

A Triple of Heavy Subgraphs Ensuring Pancyclicity of 2-Connected Graphs

Wojciech Wide (2017)

Discussiones Mathematicae Graph Theory

Similarity:

A graph G on n vertices is said to be pancyclic if it contains cycles of all lengths k for k ∈ {3, . . . , n}. A vertex v ∈ V (G) is called super-heavy if the number of its neighbours in G is at least (n+1)/2. For a given graph H we say that G is H-f1-heavy if for every induced subgraph K of G isomorphic to H and every two vertices u, v ∈ V (K), dK(u, v) = 2 implies that at least one of them is super-heavy. For a family of graphs H we say that G is H-f1-heavy, if G is H-f1-heavy for...