On the smallest positive eigenvalue of bipartite graphs with a unique perfect matching

DOI10.1016/j.dam.2024.01.029MaRDI QIDQ6121713

Subhasish Behera, Sukanta Pati, Sasmita Barik

Publication date: 27 February 2024

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

zbMATH Keywords

bipartite graphadjacency matrixlimit pointunique perfect matchingsmallest positive eigenvalue

Mathematics Subject Classification ID

Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Eigenvalues, singular values, and eigenvectors (15A18)

Cites Work

• Ordering trees by their spectral radii
• Inverses of trees
• The limit points of eigenvalues of graphs
• On the distribution of the maximum eigenvalues of graphs
• Sharp lower bounds on the eigenvalues of trees
• The graphs with spectral radius between 2 and \(\sqrt{2+\sqrt{5}}\)
• Signed graphs, root lattices, and Coxeter groups
• Ordering graphs with small index and its application
• Acyclic molecules with greatest HOMO-LUMO separation
• On the smallest positive eigenvalue of bipartite unicyclic graphs with a unique perfect matching
• On alternating paths and the smallest positive eigenvalue of trees
• Inverses of triangular matrices and bipartite graphs
• HL-index of a graph
• On the inverse and the dual index of a tree
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: On the smallest positive eigenvalue of bipartite graphs with a unique perfect matching