Curling Numbers of Certain Graph Powers

Abstract

Given a finite nonempty sequence $S$ of integers, write it as $X{Y}^k$, where $Y^k$ is a power of greatest exponent that is a suffix of $S$: this $k$ is the curling number of $S$. The concept of curling number of sequences has already been extended to the degree sequences of graphs to define the curling number of a graph. In this paper we study the curling number of graph powers, graph products and certain other graph operations.

8 Pages, Submitted

Cited by in corpus (3)

• Some New Results on the Curling Number of Graphs
• On Chromatic Curling Number of Graphs
• A study on the curling number of graph classes