On estimation of extremal entries of the principal eigenvector of a graph
Year: 2024
Type: article
Abstract: Let X=(x1,x2,…,xn)T be the principal eigenvector corresponding to the spectral radius λ1 of a graph G of order n. In this paper, we find some bounds on the ratio of the maximal component xmax to the minimal component xmin of the principal eigenvector X in terms of the graph parameters such as the independence number β, the minimum vertex cover number of the vertex α and the chromatic number χ. Also, we present some bounds on the extremal component xmax of the principal eigenvector X. An upper bound of the spectral radius λ1 of G in terms of the minimum vertex cover number α and order of the graph n is also introduced in this paper.
Authors: Prohelika Das, Bipanchy Buzarbarua
Institution: Cotton University
Language: English
Subfield: Geometry and Topology
Field: Mathematics
Domain: Physical Sciences
Open Access status: gold
Estimated APC paid: $1,226
OpenAlex ID: W4404239990