pith. sign in

arxiv: 1304.7411 · v2 · pith:PRFPI5BYnew · submitted 2013-04-27 · 🧮 math.CO

Multiplicity of 1 in Laplacian Spectra of trees

classification 🧮 math.CO
keywords multiplicityintroducetreeslaplaciancasedegreeequalityfaria
0
0 comments X
read the original abstract

In this paper, we interpret the multiplicity of 1 in Laplacian spectra of trees and prove that Faria's inequality turns to an equality in the case of normal trees which yields that in any tree without a vertex of degree 2, Faria equality holds and multiplicity of 1 in Laplacian spectrum will be equal to star degree of the the tree. As a result we introduce a combinatorial procedure for computing the multiplicity of 1. In the way to prove this results we will introduce many transformation on graphs which are invariant regarding to the multiplicity of 1. We also introduce an inequality for the multiplicity of 0 in adjacency spectrum of graphs and again introduce a procedure to compute this multiplicity in the case of trees.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.