Graphs having two main eigenvalues and arbitrarily many distinct vertex degrees

Mohammad Ghebleh, Salem Al-Yakoob, Ali Kanso and Dragan Stevanović

Applied Mathematics and Computation, 2025, vol. 495, issue C

Abstract: Arif, Hayat and Khan [J Appl Math Comput 69 (2023) 2549–2571] recently proposed the problem of finding explicit construction for (an infinite family of) graphs having at least three distinct vertex degrees and two main eigenvalues. After computationally identifying small examples of such graphs, we fully solve this problem by showing that the edge-disjoint union of an almost semiregular graph G and a regular graph H defined on the constant part of G yields a new harmonic graph under mild conditions. As a special case, this result provides for every integer b≥2 an explicit construction of a graph with two main eigenvalues and 2b−1 distinct vertex degrees. This construction also provides partial answers to questions posed by Hayat et al. in [Linear Algebra Appl 511 (2016) 318–327].

Keywords: Main eigenvalues; Harmonic graphs; Almost semiregular graphs; Vertex degrees (search for similar items in EconPapers)
Date: 2025
References: Add references at CitEc
Citations:

Downloads: (external link)
http://www.sciencedirect.com/science/article/pii/S0096300325000384
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:495:y:2025:i:c:s0096300325000384

DOI: 10.1016/j.amc.2025.129311

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 ().