Abstract
Let 2K3 denote the disjoint union of two triangles. Given a graph H, a graph is said to be H-free if it does not contain H as a subgraph. In spectral extremal graph theory, it is interesting to determine the maximum (signless Laplacian) spectral radius of H-free graphs. In this paper, we characterize the unique extremal graph with the maximum signless Laplacian spectral radius among all 2K3-free graphs of order n≥44.
Original language | English |
---|---|
Article number | 114075 |
Journal | Discrete Mathematics |
Volume | 347 |
Issue number | 9 |
DOIs | |
State | Published - Sep 2024 |
Keywords
- 2K-free graphs
- Extremal graph
- Signless Laplacian spectral radius