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

DOI10.17654/0974165822043MaRDI QIDQ5055019zbMATH OpenOpenAlexFDO

Authors Bipanchy Buzarbarua, Prohelika Das

Publication date 12 December 2022

Published in Advances and Applications in Discrete Mathematics (Search for Journal in Brave)

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://doi.org/10.17654/0974165822043

zbMATH Keywords

clique numberindependence numberminimum vertex cover numberprincipal eigenvectorspectral radiuswalks

Mathematics Subject Classification ID

Trees (05C05) Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)

Recommendations

• Principal eigenvectors of irregular graphs
• On maximal entries in the principal eigenvector of graphs
• On the principal eigenvectors of uniform hypergraphs
• Principal eigenvectors of general hypergraphs
• Spectral radius and fractional matchings in graphs

Cites work

• Matrix Analysis
• On maximal entries in the principal eigenvector of graphs
• On the bounds of maximal entries in the principal eigenvector of symmetric nonnegative matrix
• Principal eigenvectors of irregular graphs

Cited in

(5)

• On maximal entries in the principal eigenvector of graphs
• Unimodality of principal eigenvector and its applications
• Principal eigenvectors of irregular graphs
• Characterizing graphs of maximum principal ratio
• The maximum principal ratio of graphs

This page was built for publication: ON SOME SPECTRAL PROPERTIES OF GRAPHS IN TERMS OF THEIR MAXIMUM MATCHINGS AND MINIMUM VERTEX COVERS

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5055019)