Back to Search
Start Over
Tarantula graphs are determined by their Laplacian spectrum
- Source :
- Electronic Journal of Graph Theory and Applications, Vol 9, Iss 2, Pp 419-431 (2021)
- Publication Year :
- 2021
- Publisher :
- The Institute for Research and Community Services (LPPM) ITB, 2021.
-
Abstract
- A graph G is said to be determined by its Laplacian spectrum (DLS) if every graph with the same Laplacian spectrum is isomorphic to G. A graph which is a collection of hexagons (lengths of these cycles can be different) all sharing precisely one vertex is called a spinner graph. A tree with exactly one vertex of degree greater than 2 is called a starlike tree. If a spinner graph and a starlike tree are joined by merging their vertices of degree greater than 2, then the resulting graph is called a tarantula graph. It is known that spinner graphs and starlike trees are DLS. In this paper, we prove that tarantula graphs are determined by their Laplacian spectrum.
- Subjects :
- Tarantula
Degree (graph theory)
Laplacian spectrum
biology
Applied Mathematics
laplacian spectrum
biology.organism_classification
Tree (graph theory)
Graph
Vertex (geometry)
Combinatorics
laplacian matrix
l-cospectral
tarantula graph
QA1-939
Discrete Mathematics and Combinatorics
Laplacian matrix
Mathematics
Subjects
Details
- ISSN :
- 23382287
- Volume :
- 9
- Database :
- OpenAIRE
- Journal :
- Electronic Journal of Graph Theory and Applications
- Accession number :
- edsair.doi.dedup.....ba269283a39784f01f975b08f5234e2f