Packing chromatic numbers of finite super subdivisions of graphs

preprint2020arXivOpen access

Abstract

The \textit{packing chromatic number} of a graph GG, denoted by % χ_ρ(G), is the smallest integer kk such that the vertex set of GG can be partitioned into sets ViV_i, i∈{1,…,k}i\in \{1,\ldots,k\}, where each ViV_i is an ii-packing. In this paper, we present some general properties of packing chromatic numbers of \textit{finite super subdivisions} of graphs. We determine the packing chromatic numbers of the finite super subdivisions of complete graphs, cycles and \textit{neighborhood corona graphs} of a cycle and a path respectively of a complete graph and a path.

Explore this paper’s authors, topics and related work.

Building this map preview

BZPEER is loading the nearby papers, people, topics and institutions for this page.

Reviews 0

Write a reviewWrite

No reviews yet.

Discussion 0

Add a commentWrite

No comments yet.