Zobrazeno 1 - 10
of 58
pro vyhledávání: '"Bouchemakh Isma"'
Publikováno v:
Discussiones Mathematicae Graph Theory, Vol 39, Iss 2, Pp 589-603 (2019)
A 2-distance k-coloring of a graph G is a mapping from V (G) to the set of colors {1,. . ., k} such that every two vertices at distance at most 2 receive distinct colors. The 2-distance chromatic number χ2(G) of G is then the smallest k for which G
Externí odkaz:
https://doaj.org/article/373e710107314599a2ed45e119c4db87
In 2001, D. Erwin \cite{Erw01} introduced in his Ph.D. dissertation the notion of broadcast independence in unoriented graphs. Since then, some results but not many, are published on this notion, including research work on the broadcast independence
Externí odkaz:
http://arxiv.org/abs/2402.19234
Publikováno v:
Discussiones Mathematicae Graph Theory, Vol 37, Iss 3, Pp 665-690 (2017)
The packing chromatic number χρ(G) of a graph G is the smallest integer k such that its set of vertices V(G) can be partitioned into k disjoint subsets V1, . . . , Vk, in such a way that every two distinct vertices in Vi are at distance greater tha
Externí odkaz:
https://doaj.org/article/aef3f10b2af8452d8a1e1de709178bf9
An independent broadcast on a graph $G$ is a function $f: V \longrightarrow \{0,\ldots,{\rm diam}(G)\}$ such that $(i)$ $f(v)\leq e(v)$ for every vertex $v\in V(G)$, where $\operatorname{diam}(G)$ denotes the diameter of $G$ and $e(v)$ the eccentrici
Externí odkaz:
http://arxiv.org/abs/2102.04094
A broadcast on a graph $G=(V,E)$ is a function $f: V\longrightarrow \{0,\ldots,\operatorname{diam}(G)\}$ such that $f(v)\leq e\_G(v)$ for every vertex $v\in V$, where$\operatorname{diam}(G)$ denotes the diameter of $G$ and $e\_G(v)$ the eccentricity
Externí odkaz:
http://arxiv.org/abs/1906.05089
Let $G$ be a simple undirected graph.A broadcast on $G$ isa function $f : V(G) \to \mathbf{N}$ such that $f(v)\le e_G(v)$ holds for every vertex $v$ of $G$, where $e_G(v)$ denotes the eccentricity of $v$ in $G$, that is, the maximum distance from $v$
Externí odkaz:
http://arxiv.org/abs/1902.02998
Let $G=$ $\left( V,E\right) $ be a simple graph.\ A non-empty set $S \subseteq V$ is called a global offensive alliance if $S$ is a dominating set and for every vertex $v$ in $V-S$, at least half of the vertices from the closed neighborhood of $v$ ar
Externí odkaz:
http://arxiv.org/abs/1804.07113
Autor:
AHMANE, MESSAOUDA1 nacerahmane@yahoo.fr, BOUCHEMAKH, ISMA1 isma_bouchemakh2001@yahoo.fr, SOPENA, ÉRIC2 Eric.Sopena@labri.fr
Publikováno v:
Discussiones Mathematicae: Graph Theory. 2024, Vol. 44 Issue 1, p199-229. 31p.
An incidence of a graph G is a pair (v, e) where v is a vertex of G and e is an edge of G incident with v. Two incidences (v, e) and (w, f) of G are adjacent whenever (i) v = w, or (ii) e = f , or (iii) vw = e or f. An incidence p-colouring of G is a
Externí odkaz:
http://arxiv.org/abs/1705.01744
Let $G$ be a simple undirected graph.A broadcast on $G$ isa function $f : V(G)\rightarrow\mathbb{N}$ such that $f(v)\le e\_G(v)$ holds for every vertex $v$ of $G$, where $e\_G(v)$ denotes the eccentricity of $v$ in $G$, that is, the maximum distance
Externí odkaz:
http://arxiv.org/abs/1612.08283