Mathematics – Combinatorics
Scientific paper
2009-12-18
Mathematics
Combinatorics
8 pages
Scientific paper
Let $G$ be a simple connected graph with $n\geq 5$ vertices. In this note, we
will prove that $s_3(G)\leq n$, and characterize the graphs which satisfy that
$s_3(G)=n, n-1, n-2, $ or $n-3$, where $s_3(G)$ is the third invariant factor
of the Laplacian matrix of $G$.
Pan Yong-Liang
Wang Jian
No associations
LandOfFree
A note on the third invariant factor of the Laplacian matrix of a graph 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 A note on the third invariant factor of the Laplacian matrix of a graph, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and A note on the third invariant factor of the Laplacian matrix of a graph will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-349292