On the extensional eigenvalues of graphs

Tao Cheng, Lihua Feng, Weijun Liu and Lu Lu

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

Abstract: Assume that G is a graph on n vertices with associated symmetric matrix M and K a positive definite symmetric matrix of order n. If there exists 0≠x∈Rn such that Mx=λKx, then λ is called an extensional eigenvalue of G with respect to K. This concept generalizes some classic graph eigenvalue problems of certain matrices such as the adjacency matrix, the Laplacian matrix, the diffusion matrix, and so on. In this paper, we study the extensional eigenvalues of graphs. We develop some basic theories about extensional eigenvalues and present some connections between extensional eigenvalues and the structure of graphs.

Keywords: Extensional eigenvalue; Extensional eigenvector; Rayleigh quotient (search for similar items in EconPapers)
Date: 2021
References: View complete reference list from CitEc
Citations:

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

DOI: 10.1016/j.amc.2021.126365

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