The signless Laplacian spectral radius of 2K3-free graphs

Yanting Zhang, Ligong Wang

Research output: Contribution to journalArticlepeer-review

1 Scopus citations

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 languageEnglish
Article number114075
JournalDiscrete Mathematics
Volume347
Issue number9
DOIs
StatePublished - Sep 2024

Keywords

  • 2K-free graphs
  • Extremal graph
  • Signless Laplacian spectral radius

Fingerprint

Dive into the research topics of 'The signless Laplacian spectral radius of 2K3-free graphs'. Together they form a unique fingerprint.

Cite this