A study on the curling number of certain graph classes

zbMATH Open1428.05067arXiv1512.01096MaRDI QIDQ5243993FDOQ5243993

N. K. Sudev, Sunny Joseph Kalayathankal, Johan Kok, K. P. Chithra, C. Susanth

Publication date: 19 November 2019

Abstract: Given a finite nonempty sequence $S$ of integers, write it as $X{Y}^k$, consisting of a prefix $X$ (which may possibly be empty), followed by $k$ copies of a non-empty string $Y$. Then, the greatest such integer $k$ is called the curling number of $S$ and is denoted by $cn(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.

Full work available at URL: https://arxiv.org/abs/1512.01096

Recommendations

• Some new results on the curling number of graphs
• On the curling number of the Mycielskian of certain graphs
• On the curling number of certain graphs
• Curling number of rooted product of general graph
• On Curling Numbers of Integer Sequences

zbMATH Keywords

curling number of a graphcompound curling number of graph

Mathematics Subject Classification ID

Vertex degrees (05C07) Structural characterization of families of graphs (05C75) Special sequences and polynomials (11B83) Sequences (mod (m)) (11B50)

This page was built for publication: A study on the curling number of certain graph classes

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