Displaying similar documents to “The path is the tree with smallest greatest Laplacian eigenvalue”

On the multiplicity of Laplacian eigenvalues of graphs

Ji-Ming Guo, Lin Feng, Jiong-Ming Zhang (2010)

Czechoslovak Mathematical Journal

Similarity:

In this paper we investigate the effect on the multiplicity of Laplacian eigenvalues of two disjoint connected graphs when adding an edge between them. As an application of the result, the multiplicity of 1 as a Laplacian eigenvalue of trees is also considered.

Connectivity, toughness, spanning trees of bounded degree, and the spectrum of regular graphs

Sebastian M. Cioabă, Xiaofeng Gu (2016)

Czechoslovak Mathematical Journal

Similarity:

The eigenvalues of graphs are related to many of its combinatorial properties. In his fundamental work, Fiedler showed the close connections between the Laplacian eigenvalues and eigenvectors of a graph and its vertex-connectivity and edge-connectivity. We present some new results describing the connections between the spectrum of a regular graph and other combinatorial parameters such as its generalized connectivity, toughness, and the existence of spanning trees with bounded degree. ...

On the number of spanning trees, the Laplacian eigenvalues, and the Laplacian Estrada index of subdivided-line graphs

Yilun Shang (2016)

Open Mathematics

Similarity:

As a generalization of the Sierpiński-like graphs, the subdivided-line graph Г(G) of a simple connected graph G is defined to be the line graph of the barycentric subdivision of G. In this paper we obtain a closed-form formula for the enumeration of spanning trees in Г(G), employing the theory of electrical networks. We present bounds for the largest and second smallest Laplacian eigenvalues of Г(G) in terms of the maximum degree, the number of edges, and the first Zagreb index of G....

Some properties of the distance Laplacian eigenvalues of a graph

Mustapha Aouchiche, Pierre Hansen (2014)

Czechoslovak Mathematical Journal

Similarity:

The distance Laplacian of a connected graph G is defined by ℒ = Diag ( Tr ) - 𝒟 , where 𝒟 is the distance matrix of G , and Diag ( Tr ) is the diagonal matrix whose main entries are the vertex transmissions in G . The spectrum of ℒ is called the distance Laplacian spectrum of G . In the present paper, we investigate some particular distance Laplacian eigenvalues. Among other results, we show that the complete graph is the unique graph with only two distinct distance Laplacian eigenvalues. We establish some properties...