Bicyclic graphs with exactly two main signless Laplacian eigenvalues

Mathematics – Combinatorics

Scientific paper

Rate now

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Details

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.

No associations

LandOfFree

Say what you really think

Search LandOfFree.com for scientists and scientific papers. Rate them and share your experience with other people.

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

     

Profile ID: LFWR-SCP-O-334678

  Search
All data on this website is collected from public sources. Our data reflects the most accurate information available at the time of publication.