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

DOI10.1016/j.disc.2022.113252zbMath1504.05160OpenAlexW4309347085MaRDI QIDQ2099489

Subhasish Behera, Sasmita Barik

Publication date: 23 November 2022

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

Full work available at URL: https://doi.org/10.1016/j.disc.2022.113252

zbMATH Keywords

treeunicyclic graphunique perfect matchingsmallest positive eigenvalue

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) 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)

Related Items (1)

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

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• On unimodular graphs
• Inverses of trees
• Sharp lower bounds on the eigenvalues of trees
• On the spectral radius of unicyclic graphs with perfect matchings
• On alternating paths and 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

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