2016
DOI: 10.1016/j.amc.2015.09.057
|View full text |Cite
|
Sign up to set email alerts
|

On the spectrum of the normalized Laplacian of iterated triangulations of graphs

Abstract: The eigenvalues of the normalized Laplacian of a graph provide information on its topological and structural characteristics and also on some relevant dynamical aspects, specifically in relation to random walks. In this paper we determine the spectra of the normalized Laplacian of iterated triangulations of a generic simple connected graph. As an application, we also find closed-forms for their multiplicative degree-Kirchhoff index, Kemeny's constant and number of spanning trees.Postprint (author's final draft Show more

Help me understand this report
View preprint versions

Search citation statements

Order By: Relevance

Paper Sections

Select...
5

Citation Types

1
34
0

Year Published

2016
2016
2024
2024

Publication Types

Select...
7

Relationship

1
6

Authors

Journals

citations
Cited by 65 publications
(35 citation statements)
references
References 32 publications
(38 reference statements)
1
34
0
Order By: Relevance
“…Hence, it is interesting to obtain the closed‐form formula for the multiplicative degree‐Kirchhoff index of graph G . For recent advances on this topic, one may be referred to and the references with in.…”
Section: Introductionmentioning
confidence: 99%
“…Hence, it is interesting to obtain the closed‐form formula for the multiplicative degree‐Kirchhoff index of graph G . For recent advances on this topic, one may be referred to and the references with in.…”
Section: Introductionmentioning
confidence: 99%
“…In this article, inspired by the works in Refs. [7, 23, 24, 26, and 28–31], we obtain the decomposition theorems for the Laplacian polynomial and normalized Laplacian polynomial of H n . Based on these results, explicit formulas for the Kirchhoff index, multiplicative degree‐Kirchhoff index and the number of spanning trees of H n are determined, respectively.…”
Section: Introductionmentioning
confidence: 99%
“…Recently, some closed‐form formulas for the multiplicative degree‐Kirchhoff index have been obtained for some types of graphs. One may be referred to References for detailed information.…”
Section: Introductionmentioning
confidence: 99%