The signless Laplacian spectral radius of 2K3-free graphs

Yanting Zhang; Ligong Wang

doi:10.1016/j.disc.2024.114075

The signless Laplacian spectral radius of 2K₃-free graphs

Yanting Zhang
, Ligong Wang

School of Mathematics and Statistics

Northwestern Polytechnical University Xian

Research output: Contribution to journal › Article › peer-review

2 Scopus citations

Abstract

Let 2K₃ 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 2K₃-free graphs of order n≥44.

Original language	English
Article number	114075
Journal	Discrete Mathematics
Volume	347
Issue number	9
DOIs	https://doi.org/10.1016/j.disc.2024.114075
State	Published - Sep 2024

Keywords

2K-free graphs
Extremal graph
Signless Laplacian spectral radius

Access to Document

10.1016/j.disc.2024.114075

Cite this

@article{714c6260ae7e45b690d8b534c6bcf601,

title = "The signless Laplacian spectral radius of 2K3-free graphs",

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.",

keywords = "2K-free graphs, Extremal graph, Signless Laplacian spectral radius",

author = "Yanting Zhang and Ligong Wang",

note = "Publisher Copyright: {\textcopyright} 2024 Elsevier B.V.",

year = "2024",

month = sep,

doi = "10.1016/j.disc.2024.114075",

language = "英语",

volume = "347",

journal = "Discrete Mathematics",

issn = "0012-365X",

publisher = "Elsevier B.V.",

number = "9",

}

TY - JOUR

T1 - The signless Laplacian spectral radius of 2K3-free graphs

AU - Zhang, Yanting

AU - Wang, Ligong

PY - 2024/9

Y1 - 2024/9

N2 - 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.

AB - 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.

KW - 2K-free graphs

KW - Extremal graph

KW - Signless Laplacian spectral radius

UR - https://www.scopus.com/pages/publications/85193231219

U2 - 10.1016/j.disc.2024.114075

DO - 10.1016/j.disc.2024.114075

M3 - 文章

AN - SCOPUS:85193231219

SN - 0012-365X

VL - 347

JO - Discrete Mathematics

JF - Discrete Mathematics

IS - 9

M1 - 114075

ER -

The signless Laplacian spectral radius of 2K₃-free graphs

Abstract

Keywords

Access to Document

Other files and links

Fingerprint

Cite this