English (United Kingdom)

https://curated-unify.zendy.io/wp-json/zendy-region/v1/featured_content/oa?rat=en

https://curated-unify.zendy.io/wp-json/zendy-region/v1/highlighted_journal/

Global: Zendy Plus annual

Presents the access of premium content as premium feature

Premium Content

Presents the keyphrase highlighting as premium feature

Keyphrase Highlighting

Presents the summarisation as premium feature

Summarisation

Insights

Presents the pdf analysis as premium feature

PDF Analysis

Presents the zaia usage as premium feature

ZAIA

Global: Zendy Plus monthly

Global: Zendy Tools annual

Global: Zendy Tools monthly

Global: Zendy Free Plan

The \textit{packing chromatic number} of a graph $G$, denoted by $%\chi_\rho(G)$, is the smallest integer $k$ such that the vertex set of $G$ canbe partitioned into sets $V_i$, $i\in \{1,\ldots,k\}$, where each $V_i$ is an$i$-packing. In this paper, we present some general properties of packingchromatic numbers of \textit{finite super subdivisions} of graphs. We determinethe packing chromatic numbers of the finite super subdivisions of completegraphs, cycles and \textit{neighborhood corona graphs} of a cycle and a pathrespectively of a complete graph and a path.

Packing chromatic numbers of finite super subdivisions of graphs