Title : ( Packing chromatic number of unitary cayley graphs of ℤ n and algorithmic approaches to it )
Authors: Mojgan Afkhami , Zahra Hamed Labbafian , Sandi Klavzar , Mostafa Tavakoli ,
دانلود فایل برای اعضای دانشگاهAccess to full-text not allowed by authors
Abstract
A packing k-coloring of a graph G is a partition of V (G) into k disjoint non-empty classes V1, . . . , Vk, such that if u, v ∈ Vi, i ∈ [k], u ̸= v, then the distance between u and v is greater than i. The packing chromatic number of G is the smallest integer k which admits a packing k-coloring of G. In this paper, the packing chromatic number of the unitary Cayley graph of Zn is computed. Two metaheuristic algorithms for calculating the packing chromatic number are also proposed.
Keywords
, Packing chromatic number, unitary Cayley graph, genetic algorithm, local search algorithm.
@article{paperid:1106815,
author = {مژگان افخمی and Hamed Labbafian, Zahra and سندی کلاوژار and Tavakoli, Mostafa},
title = {Packing chromatic number of unitary cayley graphs of ℤ n and algorithmic approaches to it},
journal = {Quaestiones Mathematicae},
year = {2026},
month = {February},
issn = {1607-3606},
keywords = {Packing chromatic number; unitary Cayley graph; genetic algorithm; local
search algorithm.},
}
%0 Journal Article
%T Packing chromatic number of unitary cayley graphs of ℤ n and algorithmic approaches to it
%A مژگان افخمی
%A Hamed Labbafian, Zahra
%A سندی کلاوژار
%A Tavakoli, Mostafa
%J Quaestiones Mathematicae
%@ 1607-3606
%D 2026
