Kemeny's Constant of a Cylinder Octagonal Chain

If A(G) is the adjacency matrix of a graph G with n vertices and D−1∕2(G) is the diagonal matrix of reciprocals of square roots of vertex degrees, then the Kemeny’s constant of G is K(G) = ∑ i=2n--1- 1−λi, where λ2,λ3,…,λn are all but the largest eigenvalue of D−1∕2(G)A(G)D−1∕2(G). We use an approach based on determinants of particular tridiagonal matrices admitting certain periodicity to provide a closed formula for the Kemeny’s constant of a cylinder octagonal chain graph, where a graph in question is obtained from a linear octagonal chain graph by identifying the lateral edges. In this way we present the correct result of [S. Zaman, A. Ullah, Kemeny’s constant and global mean first passage time of random walks on octagonal cell network, Math. Meth. Appl. Sci., 46 (2023), 9177–9186] that for the graphs in question calculated the multiple of Kirchhoff index instead.

Authors

Institutions

Publication Details

Journal
Kragujevac Journal of Mathematics
Published
2026-11-16
DOI
https://doi.org/10.46793/kgjmat2609.1467a
Primary Topic
Graph theory and applications
Type
article
Field-Weighted Citation Impact
0.00
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
NOV
article

Kemeny's Constant of a Cylinder Octagonal Chain

Bader Alshamary, Zoran Stanić, Milica Anđelić
5 links
Kragujevac Journal of Mathematics
Graph theory and applications
article

Kemeny's Constant of a Cylinder Octagonal Chain

Bader Alshamary, Zoran Stanić, Milica Anđelić
article en

Abstract

If A(G) is the adjacency matrix of a graph G with n vertices and D−1∕2(G) is the diagonal matrix of reciprocals of square roots of vertex degrees, then the Kemeny’s constant of G is K(G) = ∑ i=2n--1- 1−λi, where λ2,λ3,…,λn are all but the largest eigenvalue of D−1∕2(G)A(G)D−1∕2(G). We use an approach based on determinants of particular tridiagonal matrices admitting certain periodicity to provide a closed formula for the Kemeny’s constant of a cylinder octagonal chain graph, where a graph in question is obtained from a linear octagonal chain graph by identifying the lateral edges. In this way we present the correct result of [S. Zaman, A. Ullah, Kemeny’s constant and global mean first passage time of random walks on octagonal cell network, Math. Meth. Appl. Sci., 46 (2023), 9177–9186] that for the graphs in question calculated the multiple of Kirchhoff index instead.

Kragujevac Journal of MathematicsVol. 50(9)
Kuwait University (KW), University of Belgrade (RS)
Graph theory and applications
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.

Laika access coming soon