Bipartite graphs with bounded vertex degree and largest eigenvalue of the form r

Aleksandar Ilić

Applied Mathematics and Computation, 2018, vol. 330, issue C, 288-291

Abstract: In this note, we generalize two results from [2] and [3] and for every Δ and Δ ≤ r ≤ Δ2 construct a family of bipartite graphs with the maximal vertex degree Δ and largest eigenvalue equal to r.

Keywords: Bipartite graphs; Spectral radius; Chemical graphs (search for similar items in EconPapers)
Date: 2018
References: View complete reference list from CitEc
Citations:

Downloads: (external link)
http://www.sciencedirect.com/science/article/pii/S0096300318301620
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:330:y:2018:i:c:p:288-291

DOI: 10.1016/j.amc.2018.02.052

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