Paper Info
Title
Maximize the Q -index of graphs with fixed order and size
Abstract
In this paper, we consider two kinds of spectral extremal questions. The first asks which graph attains the maximum Q-index over all graphs of order n and size m = n + k? The second asks which graph attains the maximum Q-index over all (p, q)-bipartite graphs with m = p + q + k edges? We solve the first question for 4 <= k <= n - 3, and the second question for -p - q <= k <= p - q. The maximum Q-index on connected (p, q)-bipartite graphs is also determined for -1 <= k <= p - 2. (c) 2021 Elsevier B.V. All rights reserved.
Year
DOI
Venue
2022
10.1016/j.disc.2021.112669
DISCRETE MATHEMATICS
Keywords
DocType
Volume
Q-index, Extremal graph, Bipartite graph, Size, Order
Journal
345
Issue
ISSN
Citations 
1
0012-365X
0
PageRank 
References 
Authors
0.34
0
3
Name
Order
Citations
PageRank
Mingqing Zhai1186.26
Huiqiu Lin23411.56
Yanhua Zhao310.71