Some Nordhaus-Gaddum type results of Aα-eigenvalues of weighted graphs

Changxiang He, Wenyan Wang, Yuying Li and Lele Liu

Applied Mathematics and Computation, 2021, vol. 393, issue C

Abstract: Let Gω be a weighted graph, whose adjacency matrix and weighted degree diagnoal matrix are A(Gω) and D(Gω), respectively. For a given α∈[0,1], the matrix Aα(Gω)=αD(Gω)+(1−α)A(Gω) is the Aα-matrix of Gω. If all edge weights of Gω are belonging to (0,1), by defining the complement of Gω, we obtain some Nordhaus-Gaddum type bounds concerning Aα-eigenvalues of Gω.

Keywords: Weighted graph; Aα-matrix; Nordhaus-Gaddum type inequality (search for similar items in EconPapers)
Date: 2021
References: View references in EconPapers View complete reference list from CitEc
Citations: View citations in EconPapers (1)

Downloads: (external link)
http://www.sciencedirect.com/science/article/pii/S0096300320307141
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:393:y:2021:i:c:s0096300320307141

DOI: 10.1016/j.amc.2020.125761

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