Advances and Applications in Discrete Mathematics

The Advances and Applications in Discrete Mathematics is a prestigious peer-reviewed journal indexed in the Emerging Sources Citation Index (ESCI). It is dedicated to publishing original research articles in the field of discrete mathematics and combinatorics, including topics such as graphs, coding theory, and block design. The journal emphasizes efficient and powerful tools for real-world applications and welcomes expository articles that highlight current developments in the field.

Submit Article

ON SOME SPECTRAL PROPERTIES OF GRAPHS IN TERMS OF THEIR MAXIMUM MATCHINGS AND MINIMUM VERTEX COVERS

Authors

  • Bipanchy Buzarbarua
  • Prohelika Das

Keywords:

spectral radius, principal eigenvector, walks, minimum vertex cover number, independence number, clique number.

DOI:

https://doi.org/10.17654/0974165822043

Abstract

The principal eigenvector of a graph $G$ is the unique non-zero unit vector corresponding to the spectral radius $\lambda_1$ of $G$. In this paper, we present some bounds on the minimal entry $x_{\min }$ as well as on the ratio $\frac{x_{\max }}{x_{\min }}$ of the maximal entry to the minimal entry of the principal eigenvector $X$ of a graph $G$ in terms of the spectral radius $\lambda_1$, minimum vertex cover number, maximum vertex degree, minimum vertex degree, number of edges and sum of the degrees of vertices contained in a maximum matching of $G$.

Received: August 7, 2022
Accepted: September 26, 2022

References

B. Buzarbarua and P. Das, On extreme entries of principal eigenvector a graph, Advances in Mathematics: Scientific Journal 9 (2020), 1553-1560.

M. S. Cioaba and A. D. Gregory, Principal eigenvectors of irregular graphs, Electronic Journal of Linear Algebra, A publication of the International Linear Algebra Society 16 (2007), 366-379.

P. Das and B. Buzarbarua, On estimation of extremal entries of the principal eigenvector of a graph (2022). https://ssrn.com/abstract=4158174.

F. A. Goldberg, Lower bound on the entries of the principal eigenvector of a graph, 2014. arXiv:1403.1479, https://doi.org/10.48550/arXiv.1403.1479.

R. A. Horn and C. R. Johnson, Matrix Analysis, Cambridge University Press, New York, 1985.

B. Papendieck and P. Recht, On maximal entries in principal eigenvector of graphs, Linear Algebra Appl. 310 (2000), 129-138.

B. D. West, Introduction to Graph Theory, Prentice-Hall, 2nd ed., New Jersey, 2001.

D. X. Zhang, Eigenvectors and eigenvalues of non-regular graph, Linear Algebra Appl. 409 (2005), 479-486.

S. Zhao and Y. Hong, On the bounds of maximal entries in the principal eigenvector of symmetric nonnegative matrix, Linear Algebra Appl. 340 (2001), 245-252.

Published

2022-10-10

Issue

Section

Articles

How to Cite

ON SOME SPECTRAL PROPERTIES OF GRAPHS IN TERMS OF THEIR MAXIMUM MATCHINGS AND MINIMUM VERTEX COVERS. (2022). Advances and Applications in Discrete Mathematics, 34, 57-66. https://doi.org/10.17654/0974165822043

Similar Articles

1-10 of 130

You may also start an advanced similarity search for this article.