Please use this identifier to cite or link to this item:
https://research.matf.bg.ac.rs/handle/123456789/1340
Title: | Connected (K<inf>4</inf>−e)-free graphs whose second largest eigenvalue does not exceed 1 | Authors: | Liu, Muhuo Chen, Chaohui Stanić, Zoran |
Issue Date: | 1-Jan-2024 | Rank: | M22 | Publisher: | Elsevier | Journal: | European Journal of Combinatorics | Abstract: | Connected graphs whose second largest eigenvalue λ2 does not exceed 1 have been investigated in the last four decades. Over the years only few particular classes with this spectral property are completely determined. For example, they include bipartite graphs, line graphs and threshold graphs. In this paper we determine all connected (K4−e)-free graphs, i.e., the graphs that do not contain an induced subgraph isomorphic to the graph obtained by removing an edge from the complete graph of order 4; such graphs are also called diamond-free graphs. Since every triangle-free graph is automatically diamond-free, our results includes all triangle-free graphs with λ2≤1. Moreover, it includes all connected bipartite graphs with the same spectral property, and therefore strengthens the result of Petrović (J. Combin. Theory B, 1991). |
URI: | https://research.matf.bg.ac.rs/handle/123456789/1340 | ISSN: | 01956698 | DOI: | 10.1016/j.ejc.2023.103775 | Rights: | Attribution-NonCommercial-NoDerivs 3.0 United States |
Appears in Collections: | Research outputs |
Files in This Item:
File | Description | Size | Format | Existing users please |
---|---|---|---|---|
SecondLargest1FIN.pdf | 271.79 kB | Adobe PDF | Request a copy | Embargoed until February 1, 2026
SCOPUSTM
Citations
1
checked on Dec 19, 2024
Page view(s)
21
checked on Dec 24, 2024
Google ScholarTM
Check
Altmetric
Altmetric
This item is licensed under a Creative Commons License