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

DOI10.1080/03081087.2023.2177247zbMATH Open1540.05097MaRDI QIDQ6546573

Subhasish Behera, Sasmita Barik

Publication date: 29 May 2024

Published in: Linear and Multilinear Algebra (Search for Journal in Brave)

Mathematics Subject Classification ID

Trees (05C05) Extremal problems in graph theory (05C35) Paths and cycles (05C38) Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Eigenvalues, singular values, and eigenvectors (15A18) Molecular structure (graph-theoretic methods, methods of differential topology, etc.) (92E10) Chemical graph theory (05C92)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• On reciprocal eigenvalue property of weighted trees
• On unimodular graphs
• Inverses of trees
• Sharp lower bounds on the eigenvalues of trees
• Bounds for the smallest positive eigenvalues of trees with perfect matchings
• Solution to a problem of C. D. Godsil regarding bipartite graphs with unique perfect matching
• 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
• On the corona of two graphs
• On the eigenvalues of trees
• Upper bounds on the smallest positive eigenvalue of trees
• HL-index of a graph
• On nonsingular trees and a reciprocal eigenvalue property
• On the inverse and the dual index of a tree
• The Spectrum of the Corona of Two Graphs

Related Items (1)

On invertible non-bipartite unicyclic graphs with a unique perfect matching and their smallest positive eigenvalues

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