2015/12/03 by C Susanth, Sunny Joseph Kalayathankal, C, Susanth +6
Computer Science · Mathematics · #05C07 #11B50 #11B83 #Advanced Graph Theory Research #FOS: Mathematics #General Mathematics (math.GM) #Graph Labeling and Dimension Problems #Graph theory and applications
paper · pdf · doi:10.48550/arxiv.1512.01096
openalex publication_date 2015/12/03 · openalex created_date 2016/06/24 · openalex updated_date 2026/07/28
Given a finite nonempty sequence S of integers, write it as XYk, 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.