Characterizes the maximum-spectral-radius graphs in the class of minimally (k,k)-edge-connected graphs of given order or size via edge-switching and eigenvector techniques.
Oellermann, Explorations into graph connectivity,SAMS Notices,20(1988) 117–151
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
math.SP 1years
2026 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
Minimally $(k,k)$-edge-connected graphs via spectral radius
Characterizes the maximum-spectral-radius graphs in the class of minimally (k,k)-edge-connected graphs of given order or size via edge-switching and eigenvector techniques.