Abstract
Let be a non-bipartite graph which does not contain any odd cycle of length at most . In this paper, we determine the maximum -index of if its order is fixed, and the corresponding extremal graph is uniquely characterized. Moreover, if the size of is given, the maximum -index of and the unique extremal graph are also proved.
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.