Laplacian Spectral Characterization of (Broken) Dandelion Graphs

Xiaoyun Yang () and Ligong Wang ()
Additional contact information
Xiaoyun Yang: Northwestern Polytechnical University
Ligong Wang: Northwestern Polytechnical University

Indian Journal of Pure and Applied Mathematics, 2020, vol. 51, issue 3, 915-933

Abstract: Abstract Let $$H(p,tK_{1,m}^ * )$$ H ( p t K 1 m ∗ ) be a connected unicyclic graph with p + t(m + 1) vertices obtained from the cycle Cp and t copies of the star K1, m by joining the center of K1, m to each one of t consecutive vertices of the cycle Cp through an edge, respectively. When t = p, the graph is called a dandelion graph and when t ≠ p, the graph is called a broken dandelion graph. In this paper, we prove that the dandelion graph $$H(p,pK_{1,m}^ * )$$ H ( p p K 1 m ∗ ) and the broken dandelion graph $$H(p,tK_{1,m}^ * )$$ H ( p t K 1 m ∗ ) (0

Keywords: Laplacian spectrum; graph determined by its Laplacian spectrum; unicyclic graph; bipartite graph; 05C50 (search for similar items in EconPapers)
Date: 2020
References: View references in EconPapers View complete reference list from CitEc
Citations:

Downloads: (external link)
http://link.springer.com/10.1007/s13226-020-0441-5 Abstract (text/html)
Access to the full text of the articles in this series is restricted.

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:spr:indpam:v:51:y:2020:i:3:d:10.1007_s13226-020-0441-5

Ordering information: This journal article can be ordered from
https://www.springer.com/journal/13226

DOI: 10.1007/s13226-020-0441-5

Access Statistics for this article

Indian Journal of Pure and Applied Mathematics is currently edited by Nidhi Chandhoke

More articles in Indian Journal of Pure and Applied Mathematics from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().