Unicyclic and bicyclic graphs with exactly three Q-main eigenvalues

Mehrnoosh Javarsineh and Gholam Hossein Fath-Tabar

Applied Mathematics and Computation, 2017, vol. 315, issue C, 603-614

Abstract: Finding all the graphs with a certain number of Q-main eigenvalues is an algebraic graph theory problem that scientists have sought to answer it for many years. The purpose of this research is finding relationships between the algebraic properties of a signless Laplacian matrix of a graph and the other properties of that graph. In order to achieve this, we choose to characterize all the unicyclic and bicyclic graphs with exactly three distinct Q-main eigenvalues, one of which is zero.

Keywords: Graph; Signless Laplacian Matrix; Main Eigenvalue; Unicyclic graph; Bicyclic graph (search for similar items in EconPapers)
Date: 2017
References: View complete reference list from CitEc
Citations:

Downloads: (external link)
http://www.sciencedirect.com/science/article/pii/S0096300317304460
Full text for ScienceDirect subscribers only

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:eee:apmaco:v:315:y:2017:i:c:p:603-614

DOI: 10.1016/j.amc.2017.06.033

Access Statistics for this article

Applied Mathematics and Computation is currently edited by Theodore Simos

More articles in Applied Mathematics and Computation from Elsevier
Bibliographic data for series maintained by Catherine Liu ().