Some new results on the curling number of graphs

Abstract: Let

S = S_{1} S_{2} S_{3} l d o t s S_{n}

be a finite string. Write

S

in the form

X Y Y l d o t s Y = X Y^{k}

, consisting of a prefix

X

(which may be empty), followed by

k

copies of a non-empty string

Y

. Then, the greatest value of this integer

k

is called the curling number of

S

and is denoted by

c n (S)

. Let the degree sequence of the graph

G

be written as a string of identity curling subsequences say,

X_{1}^{k_{1}} c i r c X_{2}^{k_{2}} c i r c X_{3}^{k_{3}} l d o t s c i r c X_{l}^{k_{l}}

. The compound curling number of

G

, denoted

c n^{c} (G)

is defined to be,

c n^{n} (G) = p r o d l i m i t s_{i = 1}^{l} k_{i}

. In this paper, we discuss the curling number and compound curling number of certain products of graphs.

Recommendations

Cited in

(4)

This page was built for publication: Some new results on the curling number of graphs