Zobrazeno 1 - 4
of 4
pro vyhledávání: '"Joice Santos do Nascimento"'
Publikováno v:
Revista Integración, Vol 40, Iss 1 (2022)
Caterpillar trees, or simply Caterpillar, are trees such that when we remove all their leaves (or end edge) we obtain a path. The number of nonisomorphic caterpillars with n ≥ 2 edges is 2n−3 + 2⌊(n−3)/2⌋. Using a new sum of graphs, introdu
Externí odkaz:
https://doaj.org/article/0709e4a60a8842c78b5eb6dd283c7e1c
Publikováno v:
Revista Integración, Volume: 40, Issue: 1, Pages: 77-85, Published: 24 AUG 2022
Caterpillar trees, or simply Caterpillar, are trees such that when we remove all their leaves (or end edge) we obtain a path. The number of nonisomorphic caterpillars with n ≥ 2 edges is 2 n−3 + 2 ⌊(n−3)/2⌋ . Using a new sum of graphs, intr
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::f617c26b643820045b7495d98bb8ab3c
http://www.scielo.org.co/scielo.php?script=sci_arttext&pid=S0120-419X2022000100077&lng=en&tlng=en
http://www.scielo.org.co/scielo.php?script=sci_arttext&pid=S0120-419X2022000100077&lng=en&tlng=en
Autor:
Clarianne Luciola de A. V. M. Lucas, Renata R. Del-Vecchio, Maria Aguieiras A. de Freitas, Joice Santos do Nascimento
Publikováno v:
Computational and Applied Mathematics. 41
Publikováno v:
Discrete Applied Mathematics. 266:141-152
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.