Abstract

ubic graphs of given order with maximum number of triangles are characterized. Consequently, it is proved that certain cubic graphs with maximum number of triangles are determined by their adjacency spectrum.

Full Text
Published version (Free)

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call