IJPAM: Volume 106, No. 8 (2016)

$T$-COLORING OF SIERPINSKI-LIKE GRAPHS

P. Sivagami$^{1}$, Indra Rajasingh$^{2}$
$^{1}$Research and Development Centre
Bharathiar University
Coimbatore, INDIA
$^1$Department of Mathematics
Jeppiaar Engineering College
Chennai, INDIA
$^{2}$School of Advanced Sciences
VIT University
Chennai, INDIA


Abstract. For a given finite set $T$ of non-negative integers including zero, a proper vertex coloring is called a $T$-coloring if the distance of the colors of adjacent vertices is not an element of $T$. The $T$-span of $T$-coloring is the difference between the largest and smallest colors and the $T$-span of $G$ is the minimum span over all $T$-colorings of $G$. In this paper, we compute $T$-span and $T$-edge span of Sierpinski-like graphs.

Received: February 15, 2016

AMS Subject Classification: 05C15, 05C38, 05C70, 05C76

Key Words and Phrases: $T$-coloring, $T$-span, $T$-edge span, sierpinski torus, sierpinski rhombus, sierpinski gasket torus, sierpinski gasket rhombus, extended sierpinski graphs.

Download paper from here.



DOI: 10.12732/ijpam.v106i8.9 How to cite this paper?

Source: International Journal of Pure and Applied Mathematics
ISSN printed version: 1311-8080
ISSN on-line version: 1314-3395
Year: 2016
Volume: 106
Issue: 8
Pages: 59 - 66


$T$-COLORING OF SIERPINSKI-LIKE GRAPHS%22&as_occt=any&as_epq=&as_oq=&as_eq=&as_publication=&as_ylo=&as_yhi=&as_sdtAAP=1&as_sdtp=1" title="Click to search Google Scholar for this entry" rel="nofollow">Google Scholar; DOI (International DOI Foundation); WorldCAT.

CC BY This work is licensed under the Creative Commons Attribution International License (CC BY).