Results 1 to 10 of about 151 (76)
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
exaly +2 more sources
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.
Nibedita Mandal, Pratima Panigrahi
exaly +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
Journal of Mathematical Sciences and Modelling, 2018 We obtain the generating functions for the combinatorial enumeration of colorings of all hyperplanes of hypercubes for all irreducible representations of the hyperoctahedral groups.
Krishnan Balasubramanian
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
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
Equivariant Quantum Approximate Optimization Algorithm
IEEE Transactions on Quantum EngineeringConstructing effective mixer Hamiltonians is essential for enhancing the performance of the quantum approximate optimization algorithm (QAOA) in solving combinatorial optimization problems.
Boris Tsvelikhovskiy +2 more
doaj +1 more source
Electronic Janus lattice and kagome-like bands in coloring-triangular MoTe2 monolayers. [PDF]
Nat Commun, 2023 Lei L +12 more
europepmc +1 more source
One-way dependent clusters and stability of cluster synchronization in directed networks. [PDF]
Nat Commun, 2021 Lodi M, Sorrentino F, Storace M.
europepmc +1 more source