Ordering Q-indices of graphs: given size and girth

From MaRDI portal
Publication:6409732

arXiv2209.01771MaRDI QIDQ6409732FDOQ6409732


Authors: Yarong Hu, Zhenzhen Lou, Qiongxiang Huang Edit this on Wikidata


Publication date: 5 September 2022

Abstract: The signless Laplacian matrix in graph spectra theory is a remarkable matrix of graphs, and it is extensively studied by researchers. In 1981, Cvetkovi'{c} pointed 12 directions in further investigations of graph spectra, one of which is "classifying and ordering graphs". Along with this classic direction, we pay our attention on the order of the largest eigenvalue of the signless Laplacian matrix of graphs, which is usually called the Q-index of a graph. Let mathbbG(m,g) (resp. mathbbG(m,geqg)) be the family of connected graphs on m edges with girth g (resp. no less than g), where gge3. In this paper, we firstly order the first (lfloorfracg2floor+2) largest Q-indices of graphs in mathbbG(m,g), where mge3gge12. Secondly, we order the first (lfloorfracg2floor+3) largest Q-indices of graphs in mathbbG(m,geqg), where mge3gge12. As a complement, we give the first five largest Q-indices of graphs in mathbbG(m,3) with mge9. Finally, we give the order of the first eleven largest Q-indices of all connected graphs with size m.













This page was built for publication: Ordering $Q$-indices of graphs: given size and girth

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6409732)