The Nordhaus–Gaddum type inequalities of Aα-matrix

Xing Huang, Huiqiu Lin and Jie Xue

Applied Mathematics and Computation, 2020, vol. 365, issue C

Abstract: For a real number α ∈ [0, 1], the Aα-matrix of a graph G is defined as Aα(G)=αD(G)+(1−α)A(G), where A(G) and D(G) are the adjacency matrix and diagonal degree matrix of G, respectively. The Aα-spectral radius of G, denoted by ρα(G), is the largest eigenvalue of Aα(G). In this paper, the Nordhaus–Gaddum type bounds for the Aα-spectral radius are considered.

Keywords: Aα-matrix; Spectral radius; Nordhaus–Gaddum (search for similar items in EconPapers)
Date: 2020
References: Add references at CitEc
Citations: View citations in EconPapers (1)

Downloads: (external link)
http://www.sciencedirect.com/science/article/pii/S0096300319307088
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:365:y:2020:i:c:s0096300319307088

DOI: 10.1016/j.amc.2019.124716

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