The packing chromatic number χρ(G) of a graph G is the smallest integer k for which there exists a mapping π:V(G)⟶{1,2,…,k} such that any two vertices of color i are at distance at least i+1. In this paper, we compute the packing chromatic number for certain fan and wheel related graphs. © 2016 Kalasalingam University

Roy Santiago

Department of Mathematics

School of Advanced Sciences

Vellore Campus

Fulltext

Vellore Institute of Technology (VIT) is a private university located in&nbsp;Tamil Nadu, India. Founded in 1984, as Vellore Engineering College, the institution offers 20 undergraduate, 34 postgraduate, four integrated and four research programs. It has campuses in Vellore, Amravati, Bhopal and Chennai.

VIT is one of the top ranked private universities in India according to NIRF, THE and QS Rankings.&nbsp;Govt. of India has recognized&nbsp;VIT, Vellore as an&nbsp;Institution of Eminence. This has allowed VIT to take independent quality initiatives and move up in world ranking.

&nbsp;

&nbsp;

VIT University

AKCE International Journal of Graphs and Combinatorics

Journal of Xidian University

On 2-odd Labeling of Certain Graphs

Discrete Applied Mathematics

On packing colorings of distance graphs

The packing coloring problem for lobsters and partner limited graphs

Packing chromatic number of distance graphs

Lecture Notes in Computer Science Combinatorial Optimization

The Packing Coloring Problem for (q,q-4) Graphs

Packing chromatic number of certain fan and wheel related graphs

Journal	AKCE International Journal of Graphs and Combinatorics
Publisher	Informa UK Limited
ISSN	0972-8600
Open Access	Yes