Minimizing the smallest positive eigenvalue over bipartite and bipartite bicyclic graphs with a unique perfect matching
Linear Algebra and its Applications · 2026-07 · 740 · 103-138
DOI: 10.1016/j.laa.2026.03.023 ↗Kurz gefasst
Fachartikel in der Zeitschrift Linear Algebra and its Applications, 2026-07. Verfasst von Sasmita Barik und 2 weiteren Autor:innen. Die Arbeit wurde bisher 1-mal zitiert (Crossref) und nennt 19 Literaturangaben. Gefördert von: CSIR - Human Resource Development Group, Council of Scientific and Industrial Research, India, Natural Sciences and Engineering Research Council of Canada.
Abstract (Originalsprache)
Kein Abstract verfügbar.
Förderung
- CSIR - Human Resource Development Group
- Council of Scientific and Industrial Research, India
- Natural Sciences and Engineering Research Council of Canada
Zitieren
APA
Barik, S., Fallat, S. M., & Mondal, D. (2026). Minimizing the smallest positive eigenvalue over bipartite and bipartite bicyclic graphs with a unique perfect matching. Linear Algebra and its Applications, 740, 103-138. https://doi.org/10.1016/j.laa.2026.03.023
Vancouver
Barik S, Fallat SM, Mondal D. Minimizing the smallest positive eigenvalue over bipartite and bipartite bicyclic graphs with a unique perfect matching. Linear Algebra and its Applications. 2026;740:103-138. doi:10.1016/j.laa.2026.03.023
BibTeX
@article{Barik2026,
author = {Barik, Sasmita and Fallat, Shaun M. and Mondal, Debabrota},
title = {Minimizing the smallest positive eigenvalue over bipartite and bipartite bicyclic graphs with a unique perfect matching},
journal = {Linear Algebra and its Applications},
year = {2026},
volume = {740},
pages = {103--138},
doi = {10.1016/j.laa.2026.03.023}
}
EUVIMED