Results 31 to 40 of about 1,143 (224)
Packing Chromatic Number of Subdivisions of Cubic Graphs [PDF]
Graphs and Combinatorics, 2019 20 pages, 15 ...
József Balogh +2 more
openaire +3 more sources
PACKING CHROMATIC NUMBER OF CERTAIN GRAPHS [PDF]
International Journal of Pure and Apllied Mathematics, 2013 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. It is a frequency assignment problem used in wireless networks, which is also called broadcasting coloring.
A. William, S. Roy
openaire +1 more source
Packing chromatic number of square lattice [PDF]
, 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
On the packing chromatic number of square and hexagonal lattice
Ars Mathematica Contemporanea, 2013 The packing chromatic number χ ρ ( G ) of a graph G is the smallest integer k such that the vertex set V ( G ) can be partitioned into disjoint classes X 1 , …, X k , with the condition that vertices in X i have pairwise distance greater than i . We show that the packing chromatic number for the hexagonal lattice ℋ
Korže, Danilo, Vesel, Aleksander
openaire +4 more sources
The Packing Chromatic Number of Different Jump Sizes of Circulant Graphs [PDF]
Journal of Ultra Scientist of Physical Sciences Section A, 2021 The packing chromatic number χ_{p}(G) of a graph G = (V,E) is the smallest integer k such that the vertex set V(G) can be partitioned into disjoint classes V1 ,V2 ,...,Vk , where vertices in Vi have pairwise distance greater than i. In this paper, we compute the packing chromatic number of circulant graphs with different jump sizes._{}
B. CHALUVARAJU, M. KUMARA
openaire +1 more source
On packing chromatic number of subcubic outerplanar graphs
CoRR, 2017 Although it has recently been proved that the packing chromatic number is unbounded on the class of subcubic graphs, there exists subclasses in which the packing chromatic number is finite (and small). These subclasses include subcubic trees, base-3 Sierpi{ń}ski graphs and hexagonal lattices.In this paper we are interested in the packing chromatic ...
Nicolas Gastineau +2 more
openaire +2 more sources
Advanced Healthcare Materials, EarlyView.A biocompatible sodium alginate‐based hydrogel is developed as a next‐generation submucosal lifting agent intended for EMR and ESD. The optimized formulation exhibits a composition devoid of endotoxins, high viscosity, demonstrates reliable injectability, and ensures prolonged mucosal elevation.
Iram Maqsood +9 more
wiley +1 more source
The Packing Chromatic Number of the Infinite Square Grid is 15
, 2023 AbstractA packing k-coloring is a natural variation on the standard notion of graph k-coloring, where vertices are assigned numbers from $$\{1, \ldots , k\}$$ { 1 , … , k }
Bernardo Subercaseaux +1 more
openaire +2 more sources
Bioinspired Adaptive Sensors: A Review on Current Developments in Theory and Application
Advanced Materials, EarlyView.This review comprehensively summarizes the recent progress in the design and fabrication of sensory‐adaptation‐inspired devices and highlights their valuable applications in electronic skin, wearable electronics, and machine vision. The existing challenges and future directions are addressed in aspects such as device performance optimization ...
Guodong Gong +12 more
wiley +1 more source
Packing Chromatic Number of Distance Graphs [PDF]
, 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