A Spectral Condition for the Existence of the Square of a Path

Yanhua Zhao; Jongyook Park

doi:10.1007/s00373-022-02529-4

A Spectral Condition for the Existence of the Square of a Path

Yanhua Zhao
, Jongyook Park

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

4 Scopus citations

Abstract

Let P_k be the path of order k. The square Pk2 of P_k is obtained by joining all pairs of vertices with distance no more than two in P_k. A graph is called H-free if it does not contain H as a subgraph. In this paper, we consider a Brualdi-Solheid-Turán type problem for P52-free graphs, and determine the maximum spectral radius among P52-free graphs of order n.

Original language	English
Article number	126
Journal	Graphs and Combinatorics
Volume	38
Issue number	4
DOIs	https://doi.org/10.1007/s00373-022-02529-4
State	Published - Aug 2022

Keywords

Extremal graph
p-free graph
Quotient matrix
Spectral radius

Access to Document

10.1007/s00373-022-02529-4

Cite this

@article{d05877eb96624951ad0511a4626547cc,

title = "A Spectral Condition for the Existence of the Square of a Path",

abstract = "Let Pk be the path of order k. The square Pk2 of Pk is obtained by joining all pairs of vertices with distance no more than two in Pk. A graph is called H-free if it does not contain H as a subgraph. In this paper, we consider a Brualdi-Solheid-Tur{\'a}n type problem for P52-free graphs, and determine the maximum spectral radius among P52-free graphs of order n.",

keywords = "Extremal graph, p-free graph, Quotient matrix, Spectral radius",

author = "Yanhua Zhao and Jongyook Park",

note = "Publisher Copyright: {\textcopyright} 2022, The Author(s), under exclusive licence to Springer Japan KK, part of Springer Nature.",

year = "2022",

month = aug,

doi = "10.1007/s00373-022-02529-4",

language = "English",

volume = "38",

journal = "Graphs and Combinatorics",

issn = "0911-0119",

publisher = "Springer Japan",

number = "4",

}

TY - JOUR

T1 - A Spectral Condition for the Existence of the Square of a Path

AU - Zhao, Yanhua

AU - Park, Jongyook

PY - 2022/8

Y1 - 2022/8

N2 - Let Pk be the path of order k. The square Pk2 of Pk is obtained by joining all pairs of vertices with distance no more than two in Pk. A graph is called H-free if it does not contain H as a subgraph. In this paper, we consider a Brualdi-Solheid-Turán type problem for P52-free graphs, and determine the maximum spectral radius among P52-free graphs of order n.

AB - Let Pk be the path of order k. The square Pk2 of Pk is obtained by joining all pairs of vertices with distance no more than two in Pk. A graph is called H-free if it does not contain H as a subgraph. In this paper, we consider a Brualdi-Solheid-Turán type problem for P52-free graphs, and determine the maximum spectral radius among P52-free graphs of order n.

KW - Extremal graph

KW - p-free graph

KW - Quotient matrix

KW - Spectral radius

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

U2 - 10.1007/s00373-022-02529-4

DO - 10.1007/s00373-022-02529-4

M3 - Article

AN - SCOPUS:85135157023

SN - 0911-0119

VL - 38

JO - Graphs and Combinatorics

JF - Graphs and Combinatorics

IS - 4

M1 - 126

ER -

A Spectral Condition for the Existence of the Square of a Path

Abstract

Keywords

Access to Document

Other files and links

Fingerprint

Cite this