The spectral Turán problem about graphs of given size with forbidden subgraphs
Let G be a graph of size m and [Formula: see text] be the spectral radius of its adjacency matrix. A graph is said to be H-free if it does not contain a subgraph isomorphic to H. Let [Formula: see text] be the graph obtained by adding a pendent vertex to a cycle of length l. In this paper, we determ...
| Main Authors: | , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Taylor & Francis Group
2024-11-01
|
| Series: | AKCE International Journal of Graphs and Combinatorics |
| Subjects: | |
| Online Access: | https://www.tandfonline.com/doi/10.1080/09728600.2024.2421212 |