Spectral extrema of graphs: Forbidden star-path forests

IF 0.7 3区数学 Q2 MATHEMATICS

Discrete Mathematics Pub Date : 2024-12-10 DOI:10.1016/j.disc.2024.114351

Yanni Zhai , Xiying Yuan , Lihua You

引用次数: 0

Abstract

A path of order n is denoted by

P_{n}

, and a star of order n is denoted by

S_{n - 1}

. Recently, Fang and Yuan determined the Turán numbers of

k S_{ℓ - 1} \cup P_{ℓ}

k_{1} S_{2 ℓ - 1} \cup k_{2} P_{2 ℓ}

and

k S_{4} \cup 2 P_{5}

for n appropriately large. In this paper, we extend the results to the spectral counterpart. The graphs with maximum spectral radii among graphs containing no any copy of these three kinds of star-path forests are completely characterized.

查看原文本刊更多论文

求助全文

约1分钟内获得全文求助全文

来源期刊

Discrete Mathematics 数学-数学

CiteScore

1.50

自引率

12.50%

发文量

424

审稿时长

6 months

期刊介绍： Discrete Mathematics provides a common forum for significant research in many areas of discrete mathematics and combinatorics. Among the fields covered by Discrete Mathematics are graph and hypergraph theory, enumeration, coding theory, block designs, the combinatorics of partially ordered sets, extremal set theory, matroid theory, algebraic combinatorics, discrete geometry, matrices, and discrete probability theory. Items in the journal include research articles (Contributions or Notes, depending on length) and survey/expository articles (Perspectives). Efforts are made to process the submission of Notes (short articles) quickly. The Perspectives section features expository articles accessible to a broad audience that cast new light or present unifying points of view on well-known or insufficiently-known topics.