Please use this identifier to cite or link to this item:
https://research.matf.bg.ac.rs/handle/123456789/1288
Title: | Determination of particular double starlike trees by the Laplacian spectrum | Authors: | Stanić, Zoran | Affiliations: | Numerical Mathematics and Optimization | Keywords: | Double starlike tree;Laplacian matrix;Path;Vertex degree | Issue Date: | 1-Sep-2023 | Rank: | М21 | Publisher: | Elsevier | Journal: | Linear Algebra and Its Applications | Abstract: | A double starlike tree is a tree in which exactly two vertices have degree greater than two. In this study we consider double starlike trees obtained by attaching p−2(forp≥3) pendant vertices at an internal vertex and q−2(q≥3) pendant vertices at a different internal vertex of a fixed path P. We denote this tree by T≅D(a,b,c,p,q), where a,b,c stand for the numbers of vertices in segments of P obtained by deleting vertices of degree p and q. It is known that, depending on parameters, T may or may not be determined by its Laplacian spectrum. In the latter case we provide the structure of a putative tree with the same Laplacian spectrum. This result implies the known result stating that D(1,b,1,p,q) is determined by the Laplacian spectrum and two new results stating the same for D(1,b,2,p,p) and D(2,b,2,p,p). |
Description: | © 2023. This manuscript version is made available under the CC-BY-NC-ND 3.0 license https://creativecommons.org/licenses/by-nc-nd/3.0/ |
URI: | https://research.matf.bg.ac.rs/handle/123456789/1288 | ISSN: | 00243795 | DOI: | 10.1016/j.laa.2023.04.028 | Rights: | Attribution-NonCommercial-NoDerivs 3.0 United States |
Appears in Collections: | Research outputs |
Files in This Item:
File | Description | Size | Format | |
---|---|---|---|---|
dstreeFINAL.pdf | 395.56 kB | Adobe PDF | View/Open |
SCOPUSTM
Citations
1
checked on Nov 8, 2024
Page view(s)
23
checked on Nov 14, 2024
Download(s)
4
checked on Nov 14, 2024
Google ScholarTM
Check
Altmetric
Altmetric
This item is licensed under a Creative Commons License