Minimum degree and size conditions for the proper connection number of graphs

is under the conditions of adding the minimum degree and optimizing the number of edges. our main result is the following, by adding a minimum degree condition: Let

G

be a connected graph of order

n

,

k g e q 3

. If

, then

p c (G) l e q k

, where

m

takes the value

t

if

d e l t a = 1

and

l f l o o r f r a c k d e l t a - 1 f l o o r

if

d e l t a g e q 2

. Furthermore, if

k = 2

and

d e l t a = 2

, %(i.e.,

)

p c (G) l e q 2

, except

G i n G_{1}, G_{n}

(

n g e q 8

), where

G_{1} = K_{1} v e e 3 K_{2}

and

G_{n}

is obtained by taking a complete graph

K_{n - 5}

and

K_{1} v e e (2 K_{2}

) with an arbitrary vertex of

K_{n - 5}

and a vertex with

d (v) = 4

in

K_{1} v e e (2 K_{2}

) being joined. If

k = 2

,

d e l t a g e q 3

, we conjecture

p c (G) l e q 2

, where

m

takes the value

1

if

d e l t a = 3

and

0

if

d e l t a g e q 4

in the assumption.

Recommendations

Cites work

Cited in

(16)

This page was built for publication: Minimum degree and size conditions for the proper connection number of graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2010690)