An equitable partition based construction of graphs with the same spectral radius

Milica Anđelić, Carlos M. da Fonseca and Zoran Stanić

Applied Mathematics and Computation, 2026, vol. 510, issue C

Abstract: An equitable partition of a graph is a remarkable tool that provides valuable spectral information. Among other properties, it is known that the spectral radius of the divisor matrix of any equitable partition equals the spectral radius of the graph. Recently, several methods for construction of families of graphs with the same spectral radius emerged in the literature. In this paper, we develop a unified approach to cyclic-graph constructions by formulating a general method for generating families of connected graphs with a common spectral radius, grounded in the theory of equitable partitions.

Keywords: Graph; Adjacency matrix; Equitable partition; Spectral radius (search for similar items in EconPapers)
Date: 2026
References: Add references at CitEc
Citations:

Downloads: (external link)
http://www.sciencedirect.com/science/article/pii/S0096300325004229
Full text for ScienceDirect subscribers only

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:eee:apmaco:v:510:y:2026:i:c:s0096300325004229

DOI: 10.1016/j.amc.2025.129696

Access Statistics for this article

Applied Mathematics and Computation is currently edited by Theodore Simos

More articles in Applied Mathematics and Computation from Elsevier
Bibliographic data for series maintained by Catherine Liu ().