On estimation of extremal entries of the principal eigenvector of a graph

On estimation of extremal entries of the principal eigenvector of a graph

Let [Formula: see text] be the principal eigenvector corresponding to the spectral radius [Formula: see text] of a graph G of order n. In this paper, we find some bounds on the ratio of the maximal component [Formula: see text] to the minimal component [Formula: see text] of the principal eigenvecto...

Full description

Saved in:
Bibliographic Details
Main Authors: Prohelika Das, Bipanchy Buzarbarua
Format: Article
Language:English
Published: Taylor & Francis Group 2025-01-01
Series:AKCE International Journal of Graphs and Combinatorics
Subjects:
Spectral radius
principal eigenvector
independence number
clique number
chromatic number
minimal vertex cover number
Online Access:https://www.tandfonline.com/doi/10.1080/09728600.2024.2411951
Tags: Add Tag
No Tags, Be the first to tag this record!

Internet

https://www.tandfonline.com/doi/10.1080/09728600.2024.2411951

Similar Items