Curling Numbers of Certain Graph Powers

2015/09/01 by Susanth C., C Susanth, Sunny Joseph Kalayathankal +8 · 1 citation
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 #math.GM #msc:05C07 #msc:11B50 #msc:11B83

paper · pdf · doi:10.48550/arxiv.1509.00220

8 Pages, Submitted

openalex publication_date 2015/09/01 · arxiv created 2015/11/17 · arxiv updated 2015/11/18 · openalex created_date 2016/06/24 · openalex updated_date 2026/07/28

Abstract

Given a finite nonempty sequence S of integers, write it as XY^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.

Citations

• A Dynamic Survey of Graph Labeling

Cited by

• A study on the curling number of graph classes

Related

• A study on the curling number of graph classes
• Some New Results on the Curling Number of Graphs
• On the Curling Number of Certain Graphs
• The Curling Number Conjecture
• A Graph-Theoretic Encoding of Lucas Sequences