The characteristic polynomial of generalized lollipop graphs

Fernando Tura

Applied Mathematics and Computation, 2018, vol. 337, issue C, 137-143

Abstract: A generalized lollipop graph is formed by connecting a tree and a threshold graph with an edge. Motivated by a sequence of algorithms that compute the characteristic polynomial of some classes of graphs, we present an algorithm for computing the characteristic polynomial of generalized lollipop graph with relation to signless Laplacian matrix Q. As application, we show how to construct graphs having Q-cospectral mate.

Keywords: Signless Laplacian matrix; Characteristic polynomial; Generalized lollipop graphs (search for similar items in EconPapers)
Date: 2018
References: View complete reference list from CitEc
Citations:

Downloads: (external link)
http://www.sciencedirect.com/science/article/pii/S0096300318304053
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:337:y:2018:i:c:p:137-143

DOI: 10.1016/j.amc.2018.05.002

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 ().