Results 31 to 40 of about 9,106,907 (129)
The Packing Chromatic Number of Random d-regular Graphs [PDF]
, 2015 Let G = (V (G),E(G)) be a simple graph of order n and let i be a positive integer. Xi superset V (G) is called an i-packing if vertices in Xi are pairwise distance more than i apart. A packing coloring of G is a partition X = {X1,X2,X3, . . .
Clifton, Ann Wells
core +1 more source
On the Packing Chromatic Number on Hamming Graphs and General Graphs
CoRR, 2015 The packing chromatic number $χ_ρ(G)$ of a graph $G$ is the smallest integer $k$ needed to proper color the vertices of $G$ in such a way the distance between any two vertices having color $i$ be at least $i+1$. We obtain $χ_ρ(H_{q,m})$ for $m=3$, where $H_{q,m}$ is the Hamming graph of words of length $m$ and alphabet with $q$ symbols, and tabulate ...
Graciela L. Nasini +2 more
openaire +3 more sources
Packing Chromatic Number of Cycle Related Graphs
International Journal of Mathematics and Soft Computing, 2014 The packing chromatic number I‡ (G) of a graph G is the smallest integer k for which there exists a mapping I : V (G) −→ {1, 2, ..., k} such that any two vertices of color i are at distance at least i + 1. It is a frequency assignment problem used in wireless networks, which is also called Broadcasting coloring.
Indra Rajasingh +2 more
openaire +1 more source
Packing chromatic numbers of finite super subdivisions of graphs
Filomat, 2020 Given a graph G and a positive integer i, an i-packing in G is a subset W of the vertex set of G such that the distance between any two distinct vertices from W is greater than i. The packing chromatic number of a graph G, ??(G), is the smallest integer k such that the vertex set of G can be partitioned into sets Vi, i ?
Lemdani, Rachid +2 more
openaire +3 more sources
Computer search for packing chromatic number for different lattices [PDF]
, 2018 Pojem pakirnega kromatskega števila prihaja iz področja načrtovanja frekvenc v brezžičnih omrežjih. Pri pakiranju k-barv grafa G, morajo biti vozlišča grafa z barvo i paroma na večji razdalji kot si.
Markuš, Žiga
core
Packing chromatic number of subcubic graphs
, 2017 16 pages, 2 ...
Balogh, József +2 more
openaire +2 more sources
Algebraic Properties of Chromatic Polynomials and Their Roots [PDF]
, 2015 In this thesis we examine chromatic polynomials from the viewpoint of algebraic number theory. We relate algebraic properties of chromatic polynomials of graphs to structural properties of those graphs for some simple families of graphs.
Gilmore, Hamish Julian
core
Packing chromatic number of square lattice
, 2022 A dissertation submitted in partial fulfilment of the requirements for the degree of Master of Science to the Faculty Science, School of Mathematics, University of the Witwatersrand, Johannesburg, 2022The notion of packing coloring comes from the area ...
Sarila, Jabulani Harmony
core
Packing Chromatic Number of Distance Graphs
, 2011 The packing chromatic number (G) of a graph G is the smallest integer k such that vertices of G can be partitioned into disjoint classes X
Jan Ekstein, et al.
core
The s-packing chromatic number of a graph [PDF]
, 2012 Let S = (a₁, a₂, ...) be an infinite nondecreasing sequence of positive integers. An S-packing k-coloring of a graph G is a mapping from V(G) to {1,2,...,k} such that vertices with color i have pairwise distance greater than $a_i$, and the S-packing ...
Xu, Honghai, Goddard, Wayne
core +1 more source