The maximum spectral radius of C_4-free graphs of given order and size

Mathematics – Combinatorics

Scientific paper

Rate now

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Details

Scientific paper

Let G be a graph of n vertices and m edges, and let G has no cycles of length
4. We give upper bounds on the adjacency spectral radius of G in terms of n and
m.

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

The maximum spectral radius of C_4-free graphs of given order and size 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 The maximum spectral radius of C_4-free graphs of given order and size, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and The maximum spectral radius of C_4-free graphs of given order and size will most certainly appreciate the feedback.

Rate now

     

Profile ID: LFWR-SCP-O-325208

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