Tarantula graphs are determined by their Laplacian spectrum

Reza Sharafdini, Ali Zeydi Abdian

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.


Keywords


tarantula graph; Laplacian matrix; Laplacian spectrum; L-cospectral

Full Text:

PDF

DOI: http://dx.doi.org/10.5614/ejgta.2021.9.2.14

References

A.Z. Abdian, Graphs which are determined by their spectrum, Konuralp J. Math., 4 (2016), 34–41.

A.Z. Abdian, Two classes of multicone graphs determined by their spectra, J. Math. Ext., 10 (2016), 111–121.

A.Z. Abdian, A.R. Ashrafi and M. Brunetti, Signless Laplacian spectral characterization of roses, Kuwait j Science, 47 (2020), 12–18.

A.Z. Abdian, Graphs cospectral with multicone graphs Kw∇L(P), TWMS. J. App and Eng. Math. 7 (2017), 181–187.

A.Z. Abdian, The spectral determination of the multicone graphs Kw∇P, arXiv preprint arXiv:1703.08728 (2017).

A.Z. Abdian, A. Behmaram, and G.H. Fath-Tabar, Graphs determined by signless Laplacian spectra, AKCE Int. J. Graphs Comb., 17 (2020), 45–50.

A.Z. Abdian and S.M. Mirafzal, On new classes of multicone graph determined by their spectrums, Alg. Struc. Appl. 2 (2015), 23–34.

A.Z. Abdian and S.M. Mirafzal, The spectral characterizations of the connected multicone graphs Kw∇LHS and KwLGQ(3, 9), Discrete Math. Algorithms Appl. 10 (2018), 1850019.

A.Z. Abdian and S.M. Mirafzal, The spectral determinations of the connected multicone graphs Kw∇mP17 and Kw∇mS, Czech. Math. J. (2018), 1–14.

A.Z. Abdian, L.W. Beineke, M.R. Oboudi, A. Behmaram, K. Thulasiraman, S. Alikhani, and K. Zhao, On the spectral determinations of the connected multicone graphs Kr∇sKt, AKCE

Int. J. Graphs Comb., 17 (2020), 149–158.

A.Z. Abdian, L.W. Beineke, K. Thulasiraman, R. Tayebi Khorami, and M.R. Oboudi, The spectral determination of the connected multicone graphs Kw∇rCs, AKCE Int. J. Graphs Comb., https://doi.org/10.1080/09728600.2021.19.

A.Z. Abdian, K. Thulasiraman, and K. Zhao, The spectral characterization of the connected multicone graphs Kw∇mKn,n, AKCE Int. J. Graphs Comb., 17 (2020), 606–613.

A.Z. Abdian and M. Ziaie, Signless Laplacian spectral determinations of the starlike trees ST(n; d1) and the double starlike trees Hn(p; p), Ars Combinatorica, (2019), In press.

A.Z. Abdian, G.H. Fath-Tabar, and M. R. Moghaddam, The spectral determination of the multicone graphs Kw∇C with respect to their signless Laplacian spectra, J. Algebraic Systems, 7 (2) (2020), 131–141.

A.Z. Abdian, Bell graphs are determined by their Laplacian spectra, Kragujevac J. Math., (2023), 47, 203–211.

A.Z. Abdian and A.M. Moez, The spectral determinations of the join of two friendship graphs, Honam J. Math., (2019), 41, 67–87.

W.N. Anderson and T.D. Morley, Eigenvalues of the Laplacian of a graph, Linear Multilinear Algebra 18 (1985), 141–145.

N. Biggs, Algebraic Graph Theory, Cambridge University Press, Cambridge, 1993.

S. Pouyandeh, A.M. Moez, and A.Z. Abdian, The spect redeterminations of connected multicone graphs Kw5mCP(n), Aims Mathematics 4, (2019), 1348–1356.

D. Cvetkovic, P. Rowlinson, and S. Simic, An Introduction to the Theory of Graph Spectra, London Mathematical Society Student Texts 75, Cambridge Univ. Press, Cambridge, 2010.

K.Ch. Das, The Laplacian sprectrum of a graph, Comput. and Appl. Math. 48 (2004), 715–724.

L. Feng and G. Yu, No starlike trees are Laplacian cospectral, Univ. Beograd. Publ. Elektrotehn. Fak. Ser. Mat. 18 (2007), 46–51.

R. Grone and R. Merris, The Laplacian spectrum of graph II, SIAM J. Discrete Math. 7 (1994), 221–229.

C. He and E.R. van Dam, Laplacian spectral characterization of roses, Linear Algebra Appl. (2018), in press.

J.S. Li and Y.L. Pan, A note on the second largest eigenvalue of the Laplacian matrix of a graph, Linear and Multilinear Algebra 48 (2000), 117–121.

F.J. Liu and Q.X. Huang, Laplacian spectral characterization of 3-rose graphs, Linear Algebra Appl. 439 (2013), 2914–2920.

R. Merris, A note on the Laplacian graph eigenvalues, Linear Algebra Appl. 285 (1998), 33–35.

S.M. Mirafzal and A.Z. Abdian, Spectral characterization of new classes of multicone graphs, Studia. Univ. Babes¸-Bolyai Mathematica, 62 (2017), 275–286.

S.M. Mirafzal and A.Z. Abdian, The spectral determinations of some classes of multicone graphs, J. Discrete Math. Sci. Cryptogr. 21 (2018), 179–189.

R. Sharafdini, A.Z. Abdian and A. Behmaram, Signless Laplacian determination of a family of double starlike trees, Ukrainian Mathematical Journal, In press.

R. Sharafdini and A.Z. Abdian, Signless Laplacian determination of path-friendship graphs, Acta Math. Univ. Comenianae, (2021), In press.

R. Sharafdini and A.Z. Abdian, Signless Laplacian determinations of some graphs with independent edges, Carpathian Math. Publ. 10 (2018), 185–191.

C.S. Oliveira, N.M.M. de Abreu, and S. Jurkiewilz, The characteristic polynomial of the Laplacian of graphs in (a,b)-linear cases., Linear Algebra Appl. 356 (2002), 113–121.

M.R. Oboudi, A.Z. Abdian, A.R. Ashrafi and L.W. Beineke, Laplacian spectral determination of path-friendship graphs, Accepted in AKCE Int. J. Graphs Comb., (2021), doi: 10.1080/09728600.2021.1917321.

M.R. Oboudi and A.Z. Abdian, Peacock Graphs are Determined by Their Laplacian Spectra, Iran J. Sci. Technol. Trans. Sci. 44 (2020), 787–790.

G.R. Omidi and K. Tajbakhsh, Starlike trees are determined by their Laplacian spectrum, Linear Algebra Appl. 422 (2007), 654–658.

K.L. Patra and B.K. Sahoo, Bounds for the Laplacian spectral radius of graphs, Electron. J. Graph Theory Appl. 5 (2) (2017), 276–303.

E.R. van Dam and W.H. Haemers, Which graphs are determined by their spectrum?, Linear Algebra Appl. 373 (2003), 241–272.

E.R. van Dam, Graphs with Few Eigenvalues - An Interplay between Combinatorics and Algebra, thesis, Tilburg University, 1996; https://pure.uvt.nl/portal/files/193719/ Graphswi.pdf.

L. Wang and L. Wang, Laplacian spectral characterization of clover graphs, Linear Multilinear Algebra 63 (2015), 2396–2405.

J. Wang, Q. Huang, F. Belardo, and E.M. Li Marzi, On the spectral characterizations of ∞-graphs, Discrete Math. 310 (2010), 1845–1855.

F. Wen, Q. Huang, X. Huang, and F. Liu, The spectral characterization of wind-wheel graphs, Indian J. Pure Appl. Math. 46 (2015), 613–631.


Refbacks

  • There are currently no refbacks.


ISSN: 2338-2287

Creative Commons License
This work is licensed under a Creative Commons Attribution-ShareAlike 4.0 International License.

View EJGTA Stats