Spectral extremal problem on the square of \ell-cycle

Abstract: Let

C_{e l l}

be the cycle of order

e l l

. The square of

C_{e l l}

, denoted by

C_{e l l}^{2}

, is obtained by joining all pairs of vertices with distance no more than two in

C_{e l l}

. A graph is called

F

-free if it does not contain

F

as a subgraph. Denote by

e x (n, F)

and

s p e x (n, F)

the maximum size and spectral radius over all

n

-vertex

F

-free graphs, respectively. The well-known Tur'{a}n problem asks for the

e x (n, F)

, and Nikiforov in 2010 proposed a spectral counterpart, known as Brualdi-Solheid-Tur'{a}n type problem, focusing on determining

s p e x (n, F)

. In this paper, we consider a Tur'{a}n problem on

e x (n, C_{e l l}^{2})

and a Brualdi--Solheid--Tur'{a}n type problem on

s p e x (n, C_{e l l}^{2})

. We give a sharp bound of

e x (n, C_{e l l}^{2})

and

s p e x (n, C_{e l l}^{2})

for sufficiently large

n

, respectively. Moreover, in both results, we characterize the corresponding extremal graphs for any integer

e l l g e q 6

that is not divisible by

3

.

Cited In (1)

This page was built for publication: Spectral extremal problem on the square of $\ell$-cycle