Abstract
Bicyclic graph is a connected graph in which the number of edges equals the number of vertices plus one. In this paper, we determine the graph which alone maximizes the spectral radii among all the bicyclic graphs on vertices with fixed independence number.
Connections
Explore this paper’s authors, topics and related work.
Building this map preview
BZPEER is loading the nearby papers, people, topics and institutions for this page.
Reviews 0
Write a review
No reviews yet.
Discussion 0
Add a comment
No comments yet.