On irreducible no-hole L(2, 1)-coloring of Cartesian product of trees with paths
AKCE International Journal of Graphs and Combinatorics, 2020 An L(2, 1)-coloring of a graph G is a mapping such that for all edges uv of G, and if u and v are at distance two in G. The span of an L(2, 1)-coloring f of G, denoted by span(f), is max The span of G, denoted by is the minimum span of all possible L(2 ...
Nibedita Mandal, Pratima Panigrahi
doaj +2 more sources
L(2, 1)-coloring and irreducible no-hole coloring of lexicographic product of graphs
AKCE International Journal of Graphs and Combinatorics, 2022 An L(2, 1)-coloring (or labeling) of a graph G is a mapping [Formula: see text] such that [Formula: see text] if [Formula: see text] and [Formula: see text] if [Formula: see text] The span of an L(2, 1)-coloring is the maximum color assigned by it.
Nibedita Mandal, Pratima Panigrahi
doaj +1 more source
Some classes of trees with maximum number of holes two
AKCE International Journal of Graphs and Combinatorics, 2020 An -coloring of a simple connected graph is an assignment of non-negative integers to the vertices of such that adjacent vertices color difference is at least two, and vertices that are at distance two from each other get different colors.
Srinivasa Rao Kola +2 more
doaj +1 more source
Solutions of Some L(2, 1)-Coloring Related Open Problems
Discussiones Mathematicae Graph Theory, 2016 An L(2, 1)-coloring (or labeling) of a graph G is a vertex coloring f : V (G) → Z+ ∪ {0} such that |f(u) − f(v)| ≥ 2 for all edges uv of G, and |f(u)−f(v)| ≥ 1 if d(u, v) = 2, where d(u, v) is the distance between vertices u and v in G.
Mandal Nibedita, Panigrahi Pratima
doaj +1 more source
Breeding report of a new cold resistant peach cultivar Zhongnong Hantao 5 [PDF]
Guoshu xuebaoZhongnong Hantao 5 is a new cold resistant peach (Prunus persica L.) cultivar selected from a cross between Fudao Taowang and Zhongnong Hantao 1 in 2013. The seed were sown in the hole plate in 2014, and the seedlings were planted in 2015.
SHI Meng +3 more
doaj +1 more source
Irreducible No-Hole L(2, 1)-Coloring of Edge-Multiplicity-Paths-Replacement Graph
Discussiones Mathematicae Graph Theory, 2018 An L(2, 1)-coloring (or labeling) of a simple connected graph G is a mapping f : V (G) → Z+ ∪ {0} such that |f(u)−f(v)| ≥ 2 for all edges uv of G, and |f(u) − f(v)| ≥ 1 if u and v are at distance two in G.
Mandal Nibedita, Panigrahi Pratima
doaj +1 more source
Infinitely Many Trees with Maximum Number of Holes Zero, One, and Two
Journal of Applied Mathematics, 2018 An L(2,1)-coloring of a simple connected graph G is an assignment f of nonnegative integers to the vertices of G such that fu-fv⩾2 if d(u,v)=1 and fu-fv⩾1 if d(u,v)=2 for all u,v∈V(G), where d(u,v) denotes the distance between u and v in G. The span of f
Srinivasa Rao Kola +2 more
doaj +1 more source
Enhancing the Conjugation of Nickel(II) Schiff Bases for High-Contrast Electrochromism. [PDF]
MoleculesLi JX +4 more
europepmc +1 more source
Novel representation of complexity of investment casting using injective coloring and graph adaptive consensus mechanism. [PDF]
Sci RepMobarsa D +4 more
europepmc +1 more source
Interplay of Semicoordination and π-Hole Bonding: The Case of Cocrystals of Group 10 (Ni, Pd, Pt) Dithiocarbonate Complexes with 1,4-Diiodotetrafluorobenzene. [PDF]
Int J Mol SciStozharova MA +4 more
europepmc +1 more source