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

DOI10.1016/J.DISC.2022.113252zbMATH Open1504.05160OpenAlexW4309347085MaRDI QIDQ2099489FDOQ2099489

Authors: Sasmita Barik, Subhasish Behera 

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

Recommendations

• The least eigenvalue of the signless Laplacian of non-bipartite unicyclic graphs with \(K\) pendant vertices
• Bounds for the smallest positive eigenvalues of trees with perfect matchings
• Maximizing the least Q-eigenvalue of a unicyclic graph with perfect matchings
• On the spectral radius of unicyclic graphs with perfect matchings
• The multiplicity of Laplacian eigenvalue two in unicyclic graphs

zbMATH Keywords

treeunicyclic graphunique perfect matchingsmallest positive eigenvalue

Mathematics Subject Classification ID

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

Cites Work

• Title not available (Why is that?)
• The Spectrum of the Corona of Two Graphs
• Inverses of trees
• On nonsingular trees and a reciprocal eigenvalue property
• HL-index of a graph
• Note on the HOMO-LUMO index of graphs
• On the inverse and the dual index of a tree
• On the spectral radius of unicyclic graphs with perfect matchings
• On unimodular graphs
• Sharp lower bounds on the eigenvalues of trees
• On alternating paths and the smallest positive eigenvalue of trees
• A note on median eigenvalues of bipartite graphs

Cited In (5)

• On invertible non-bipartite unicyclic graphs with a unique perfect matching and their smallest positive eigenvalues
• Maximizing the least Q-eigenvalue of a unicyclic graph with perfect matchings
• Characterizing the negative inertia index of connected graphs in terms of their girth
• On the smallest positive eigenvalue of bipartite graphs with a unique perfect matching
• On the smallest positive eigenvalue of bipartite unicyclic graphs with a unique perfect matching II

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

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