The maximum spectral radius of graphs of given size with forbidden subgraph

Abstract: Let

G

be a graph of size

m

and

h o (G)

be the spectral radius of its adjacency matrix. A graph is said to be

F

-free if it does not contain a subgraph isomorphic to

F

. In this paper, we prove that if

G

is a

K_{2, r + 1}

-free non-star graph with

m g e q (4 r + 2)^{2} + 1

, then

h o (G) l e q h o (S_{m}^{1})

, with equality if and only if

G c o n g S_{m}^{1}

. Recently, Li, Sun and Wei showed that for any

h e t a_{1, 2, 3}

-free graph of size

m g e q 8

,

h o (G) l e q f r a c 1 + s q r t 4 m - 3 2

, with equality if and only if

G c o n g S_{f r a c m + 3 2, 2}

. However, this bound is not attainable when

m

is even. We proved that if

G

is

h e t a_{1, 2, 3}

-free and

G c o n g S_{f r a c m + 3 2, 2}

with

m g e q 22

, then

h o (G) l e q h o (F_{m, 1})

if

m

is even, with equality if and only if

G c o n g F_{m, 1}

, and

h o (G) l e q h o (F_{m, 2})

if

m

is odd, with equality if and only if

G c o n g F_{m, 2}

.

This page was built for publication: The maximum spectral radius of graphs of given size with forbidden subgraph