Some results on symmetric double starlike trees

DOI10.1007/BF02896399MaRDI QIDQ2504089zbMATH OpenFDO

Authors Mirjana Lazić

Publication date 22 September 2006

Published in Journal of Applied Mathematics and Computing (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/BF02896399

zbMATH Keywords

Starlike treesymmetric double starlike tree

Mathematics Subject Classification ID

Trees (05C05)

Review text

A tree is called starlike if it has exactly one vertex of degree greater than two. A tree is called double starlike if it has exactly two adjacent vertices of degree greater than two. It is demonstrated that there exist no two cospectral non-isomorphic symmetric double starlike trees.

Recommendations

• scientific article; zbMATH DE number 5585178
• No star-like trees are Laplacian co-spectral
• scientific article; zbMATH DE number 1823807
• Graphs cospectral with starlike trees

Cites work

• scientific article; zbMATH DE number 3717357 (Why is no real title available?)
• No starlike trees are cospectral
• Some results on starlike and sunlike graphs

Cited in

(7)

• Characteristics polynomial of normalized Laplacian for trees
• Some results on starlike and sunlike graphs
• Sombor index of trees with at most three branch vertices
• No star-like trees are Laplacian co-spectral
• scientific article; zbMATH DE number 5585178 (Why is no real title available?)
• Quadratic Starlike Trees
• The solutions of two star-height problems for regular trees

This page was built for publication: Some results on symmetric double starlike trees

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2504089)