Bicyclic graphs with exactly two main signless Laplacian eigenvalues

Details Bicyclic graphs with exactly two main signless Laplacian eigenvalues Bicyclic graphs with exactly two main signless Laplacian eigenvalues

2011-12-30

arxiv.org/abs/1201.0050v1

Mathematics

Combinatorics

Scientific paper

A signless Laplacian eigenvalue of a graph $G$ is called a main signless
Laplacian eigenvalue if it has an eigenvector the sum of whose entries is not
equal to zero. In this paper, all connected bicyclic graphs with exactly two
main eigenvalues are determined.

Affiliated with

Also associated with

No associations

Rating

Bicyclic graphs with exactly two main signless Laplacian eigenvalues 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 Bicyclic graphs with exactly two main signless Laplacian eigenvalues, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Bicyclic graphs with exactly two main signless Laplacian eigenvalues will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-334678