The distance matrix of caterpillar
This work presents a study about the distance matrix of a family of trees called caterpillar graphs. Our purpose is to determine the multiplicity of −2 as distance eigenvalue and the number of distinct distance eigenvalues of a caterpillar graph.
Saved in:
Published in: | Discrete Applied Mathematics 2019-08, Vol.266, p.141-152 |
---|---|
Main Authors: | , , |
Format: | Article |
Language: | English |
Subjects: | |
Citations: | Items that this one cites |
Online Access: | Get full text |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Summary: | This work presents a study about the distance matrix of a family of trees called caterpillar graphs. Our purpose is to determine the multiplicity of −2 as distance eigenvalue and the number of distinct distance eigenvalues of a caterpillar graph. |
---|---|
ISSN: | 0166-218X 1872-6771 |
DOI: | 10.1016/j.dam.2018.10.018 |