Eccentricity and algebraic connectivity of graphs
Discrete Mathematics · 2026-01 · 349 (1) · 114663
DOI: 10.1016/j.disc.2025.114663 ↗Kurz gefasst
Fachartikel in der Zeitschrift Discrete Mathematics, 2026-01. Verfasst von B. Afshari und 1 weiteren Autor:innen. Die Arbeit wurde bisher 1-mal zitiert (Crossref) und nennt 3 Literaturangaben.
Abstract (Originalsprache)
Let $G$ be a graph on $n$ nodes with algebraic connectivity $\lambda_{2}$. The eccentricity of a node is defined as the length of a longest shortest path starting at that node. If $s_\ell$ denotes the number of nodes of eccentricity at most $\ell$, then for $\ell \ge 2$, $$\lambda_{2} \ge \frac{ 4 \, s_\ell }{ (\ell-2+\frac{4}{n}) \, n^2 }.$$ As a corollary, if $d$ denotes the diameter of $G$, then $$\lambda_{2} \ge \frac{ 4 }{ (d-2+\frac{4}{n}) \, n }.$$ It is also shown that $$\lambda_{2} \ge \frac{ s_\ell }{ 1+ \ell \left(e(G^{\ell})-m\right) },$$ where $m$ and $e(G^\ell)$ denote the number of edges in $G$ and in the $\ell$-th power of $ G $, respectively.
Zitieren
APA
Afshari, B., & Afshari, M. (2026). Eccentricity and algebraic connectivity of graphs. Discrete Mathematics, 349(1), 114663. https://doi.org/10.1016/j.disc.2025.114663
Vancouver
Afshari B, Afshari M. Eccentricity and algebraic connectivity of graphs. Discrete Mathematics. 2026;349(1):114663. doi:10.1016/j.disc.2025.114663
BibTeX
@article{Afshari2026,
author = {Afshari, B. and Afshari, M.},
title = {Eccentricity and algebraic connectivity of graphs},
journal = {Discrete Mathematics},
year = {2026},
volume = {349},
number = {1},
pages = {114663},
doi = {10.1016/j.disc.2025.114663}
}
EUVIMED