EUDML | The third smallest eigenvalue of the Laplacian matrix.

Skip to main content (access key 's'), Skip to navigation (access key 'n'), Accessibility information (access key '0')

Displaying similar documents to “The third smallest eigenvalue of the Laplacian matrix.”

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.

The star is the tree with greatest greatest Laplacian eigenvalue

Ivan Gutman (2002)

Kragujevac Journal of Mathematics

Similarity:

Extremizing algebraic connectivity subject to graph theoretic constraints.

Fallat, Shaun, Kirkland, Steve (1998)

ELA. The Electronic Journal of Linear Algebra [electronic only]

Similarity:

A property of eigenvectors of nonnegative symmetric matrices and its application to graph theory

Miroslav Fiedler (1975)

Czechoslovak Mathematical Journal

Similarity:

Estimation of the maximum multiplicity of an eigenvalue in terms of the vertex degrees of the graph of a matrix.

Johnson, Charles R., Saiago, Carlos M. (2002)

ELA. The Electronic Journal of Linear Algebra [electronic only]

Similarity:

An upper bound on algebraic connectivity of graphs with many cutpoints.

Kirkland, S. (2001)

ELA. The Electronic Journal of Linear Algebra [electronic only]

Similarity:

On certain eigenspaces of cographs.

Sander, Torsten (2008)

The Electronic Journal of Combinatorics [electronic only]

Similarity: