2015/10/01 by N. K. Sudev, C Susanth, Sudev, N. K. +8 · 1 citation
Computer Science · Engineering · Mathematics · #05C07 #05C76 #11B83 #Advanced Graph Theory Research #FOS: Mathematics #General Mathematics (math.GM) #Graph Labeling and Dimension Problems #graph theory and CDMA systems #math.GM #msc:05C07 #msc:05C76 #msc:11B83
paper · pdf · doi:10.48550/arxiv.1510.01271
11 Pages in Journal of Combinatorial Mathematics and Combinatorial Computing, 2016
openalex publication_date 2015/10/01 · arxiv created 2016/08/09 · arxiv updated 2016/08/10 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28
Let S=S1S2S3… Sn be a finite string. Write S in the form XYY… Y=XYk, 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 cn(S). Let the degree sequence of the graph G be written as a string of identity curling subsequences say, Xk11∘ Xk22∘ Xk33 … ∘ Xkll. The compound curling number of G, denoted cnc(G) is defined to be, cnn(G) = ∏li=1ki. In this paper, we discuss the curling number and compound curling number of certain products of graphs.