Please use this identifier to cite or link to this item:
https://research.matf.bg.ac.rs/handle/123456789/777| Title: | Non-bipartite graphs of fixed order and size that minimize the least eigenvalue | Authors: | Jovović, Ivana Koledin, Tamara Stanić, Zoran |
Affiliations: | Numerical Mathematics and Optimization | Keywords: | Adjacency matrix;Extremal graphs;Nested split graph;The least eigenvalue | Issue Date: | 15-Jul-2015 | Journal: | Linear Algebra and Its Applications | Abstract: | Abstract In this paper we determine the unique graph with minimal least eigenvalue (of the adjacency matrix) within the set of connected graphs of fixed order n and size m, whenever; (formula presented), where a is a fixed integral constant in; (formula presented). |
URI: | https://research.matf.bg.ac.rs/handle/123456789/777 | ISSN: | 00243795 | DOI: | 10.1016/j.laa.2015.03.027 |
| Appears in Collections: | Research outputs |
Show full item record
SCOPUSTM
Citations
1
checked on Nov 10, 2024
Page view(s)
15
checked on Nov 15, 2024
Google ScholarTM
Check
Altmetric
Altmetric
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.