On graphs having minimal fourth adjacency coefficient

Abstract: Let

G

be a graph with order

n

and adjacency matrix

m a t h b f A (G)

. The adjacency polynomial of

G

is defined as

p h i (G; l a m b d a) = d e t (l a m b d a m a t h b f I - m a t h b f A (G)) = s u m_{i = 0}^{n} m a t h b f a_{i} (G) l a m b d a^{n - i}

. Hereafter,

m a t h b f a_{i} (G)

is called the

i

-th adjacency coefficient of

G

. Denote by

m a t h f r a k G_{n, m}

the set of all connected graphs having

n

vertices and

m

edges. A graph

G

is said

4

-Sachs minimal if

mathbf{a}_4(G)=min{mathbf{a}_4(H)|Hin mathfrak{G}_{n,m}}.

The value

m i n m a t h b f a_{4} (H) | H i n m a t h f r a k G_{n, m}

is called the minimal

4

-Sachs number in

m a t h f r a k G_{n, m}

, denoted by

. In this paper, we study the relationship between the value

m a t h b f a_{4} (G)

and its structural properties. Especially, we give a structural characterization on

4

-Sachs minimal graphs, showing that each

4

-Sachs minimal graph contains a difference graph as its spanning subgraph (see Theorem 8). Then, for

n g e 4

and

n - 1 l e m l e 2 n - 4

, we determine all

4

-Sachs minimal graphs together with the corresponding minimal

4

-Sachs number

.

This page was built for publication: On graphs having minimal fourth adjacency coefficient