2003•Journal of Zhejiang Education InstituteRequires access

The Second Largest Eigenvalue of Laplacian Matrix of Connected Bipartite Graph

Yan Chen

Open publisher page 0 citations

Abstract

This paper gives the bounds of the second largest eigenvalue of Laplacian matrix of connected bipartite graph and characterizes all graphs which attain the bounds.

About this research paper

What this paper is about

This paper gives the bounds of the second largest eigenvalue of Laplacian matrix of connected bipartite graph and characterizes all graphs which attain the bounds.

Why it matters

A significance statement is not available in the OpenAlex record.

Key contribution

A contribution statement is not available in the OpenAlex record.

Method / approach

Method details are not available in the OpenAlex metadata.

Main findings

Findings are not separately available in the OpenAlex metadata.

Limitations

Limitations are not available in the OpenAlex metadata.

Applications

Application details are not available in the OpenAlex metadata.

Available abstract

This paper gives the bounds of the second largest eigenvalue of Laplacian matrix of connected bipartite graph and characterizes all graphs which attain the bounds.

Key concepts: Bipartite graph, Laplacian matrix, Eigenvalues and eigenvectors, Mathematics, Combinatorics, Graph, Algebraic connectivity, Physics

Related papers

Back to paper searchBrowse research topicsOriginal source
The Second Largest Eigenvalue of Laplacian Matrix of Connected Bipartite Graph — Research Paper | ScholarLens