Published in

Elsevier, Discrete Applied Mathematics, 10-11(161), p. 1610-1617, 2013

DOI: 10.1016/j.dam.2013.01.013

Links

Tools

Export citation

Search in Google Scholar

Signless Laplacian eigenvalues and circumference of graphs

Journal article published in 2013 by JianFeng Wang, Francesco Belardo ORCID
This paper is made freely available by the publisher.
This paper is made freely available by the publisher.

Full text: Download

Green circle
Preprint: archiving allowed
Orange circle
Postprint: archiving restricted
Red circle
Published version: archiving forbidden
Data provided by SHERPA/RoMEO

Abstract

In this paper, we investigate the relation between the QQ-spectrum and the structure of GG in terms of the circumference of GG. Exploiting this relation, we give a novel necessary condition for a graph to be Hamiltonian by means of its QQ-spectrum. We also determine the graphs with exactly one or two QQ-eigenvalues greater than or equal to 22 and obtain all minimal forbidden subgraphs and maximal graphs, as induced subgraphs, with respect to the latter property.