Signless Laplacian determination of a family of double starlike trees
UDC 517.9Two graphs are said to be $Q$-cospectral if they have the same signless Laplacian spectrum.A graph is said to be DQS if there are no other nonisomorphic graphs $Q$-cospectral with it. A tree is called double starlike if it has exactly two vertices of degree greater than 2.Let $H_n(p,q)$ wit...
Saved in:
| Date: | 2021 |
|---|---|
| Main Authors: | , , , , , |
| Format: | Article |
| Language: | English |
| Published: |
Institute of Mathematics, NAS of Ukraine
2021
|
| Online Access: | https://umj.imath.kiev.ua/index.php/umj/article/view/634 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| Journal Title: | Ukrains’kyi Matematychnyi Zhurnal |
| Download file: |  |
Institution
Ukrains’kyi Matematychnyi Zhurnal| Summary: | UDC 517.9Two graphs are said to be $Q$-cospectral if they have the same signless Laplacian spectrum.A graph is said to be DQS if there are no other nonisomorphic graphs $Q$-cospectral with it. A tree is called double starlike if it has exactly two vertices of degree greater than 2.Let $H_n(p,q)$ with $n \ge 2,$ $p \geq q \geq 2$ denote the double starlike tree obtained by attaching $p$ pendant vertices to one pendant vertex of the path $P_n$ and $q$ pendant vertices to the other pendant vertex of $P_n.$ In this paper, we prove that $H_n(p,q)$ is  DQS for $n\ge 2,$ $p\geq q\geq 2.$
  |
|---|---|
| DOI: | 10.37863/umzh.v73i9.634 |