Degree powers of graphs without Bℓ,s

Bing Wang and Jianhua Yin

Applied Mathematics and Computation, 2022, vol. 435, issue C

Abstract: Let eq(H)=∑i=1ndiq, where (d1,…,dn) is the degree sequence of graph H and q≥1 is an integer. A Turán-type problem of eq(H) is considered by Caro and Yuster: Given a graph Γ, determine the functionexq(n,Γ)=max{eq(H)|HisaΓ-freegraphofordern}.Clearly, ex1(n,Γ) is two times of the classical Turán number of Γ. Let ℓ≥4, s≥0 and Pℓ=v1v2⋯vℓ be a path of order ℓ, and let Bℓ,s be the graph obtained from Pℓ by adding s vertices u1,…,us that are adjacent to the vertex vℓ−1. The graph Bℓ,s is known as a broom. Caro and Yuster determined the value of exq(n,B4,s) when q≥2 and n is sufficiently large. Lan et al. determined the value of exq(n,Bℓ,s) when q≥2, 5≤ℓ≤7 and n is sufficiently large. In this paper, we determine the value of exq(n,B8,s) when q≥2 and n is sufficiently large. This is a solution to a conjecture due to Lan et al. for the case ℓ=8.

Keywords: Degree power; Turán-type problem; Broom (search for similar items in EconPapers)
Date: 2022
References: View complete reference list from CitEc
Citations:

Downloads: (external link)
http://www.sciencedirect.com/science/article/pii/S0096300322005239
Full text for ScienceDirect subscribers only

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:eee:apmaco:v:435:y:2022:i:c:s0096300322005239

DOI: 10.1016/j.amc.2022.127449

Access Statistics for this article

Applied Mathematics and Computation is currently edited by Theodore Simos

More articles in Applied Mathematics and Computation from Elsevier
Bibliographic data for series maintained by Catherine Liu ().