Zobrazeno 1 - 10
of 13
pro vyhledávání: '"Pouyeh Sharifani"'
Publikováno v:
AUT Journal of Mathematics and Computing, Vol 1, Iss 2, Pp 263-270 (2020)
Let $G=(V, E)$ be a simple graph without isolated vertices. A set $D\subseteq V$ is a total $[1,2]$-dominating set if for every vertex $v\in V , 1\leq |N(v)\cap D|\leq 2$. The total $[1,2]$-domination problem is to determine the total $[1,2]$-dominat
Externí odkaz:
https://doaj.org/article/7942a34e2f7c4678b029e486671681d4
Publikováno v:
Opuscula Mathematica, Vol 40, Iss 3, Pp 375-382 (2020)
A subset \(D\) of the vertex set \(V\) of a graph \(G\) is called an \([1,k]\)-dominating set if every vertex from \(V-D\) is adjacent to at least one vertex and at most \(k\) vertices of \(D\). A \([1,k]\)-dominating set with the minimum number of v
Externí odkaz:
https://doaj.org/article/96b425d77316409785197ebc4479a1a7
Publikováno v:
Transactions on Combinatorics, Vol 9, Iss 1, Pp 1-24 (2020)
For a graph $G=(V,E)$, a set $S \subseteq V$ is a $[1,2]$-set if it is a dominating set for $G$ and each vertex $v \in V \setminus S$ is dominated by at most two vertices of $S$, i.e. $1 \leq \vert N(v) \cap S \vert \leq 2$. Moreover a set $S \subset
Externí odkaz:
https://doaj.org/article/11e3884a41864aa28d0827a8f17e63de
Autor:
Pouyeh Sharifani, Narges Ghareghani
Publikováno v:
Theoretical Computer Science. 865:34-43
For any integer $k>2$, the infinite $k$-bonacci word $W^{(k)}$, on the infinite alphabet is defined as the fixed point of the morphism $��_k:\mathbb{N}\rightarrow \mathbb{N}^2 \cup \mathbb{N}$, where \begin{equation*} ��_k(ki+j) = \left\{ \be
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::113aedc67e09a6d34a9de8e6ac4af939
https://doi.org/10.1016/j.tcs.2021.02.027
https://doi.org/10.1016/j.tcs.2021.02.027
Publikováno v:
AKCE International Journal of Graphs and Combinatorics, Vol 17, Iss 3, Pp 870-876 (2020)
A dominating set in a graph G is a subset of vertices D such that every vertex in is a neighbor of some vertex of D. The domination number of G is the minimum size of a dominating set of G and it is denoted by γ(G). A dominating set with cardinality
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::8038a7e6ed9cd0ecbad65747f0713bde
https://doi.org/10.1016/j.akcej.2019.06.011
https://doi.org/10.1016/j.akcej.2019.06.011
Publikováno v:
Bulletin of the Malaysian Mathematical Sciences Society. 44:375-392
A subset D of the vertex set V(G) of a graph G is called a [1, k]-dominating set if every vertex from $$V-D$$ is adjacent to at least one vertex and at most k vertices of D. A [1, k]-dominating set with minimum number of vertices is called a $$\gamma
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::cda3ca667c28bd6247ff01e7480a3b84
https://doi.org/10.1007/s40840-020-00957-0
https://doi.org/10.1007/s40840-020-00957-0
Publikováno v:
Discrete Applied Mathematics
Discrete Applied Mathematics, 2021, 302, pp.76-79. ⟨10.1016/j.dam.2021.06.006⟩
Discrete Applied Mathematics, 2021, 302, pp.76-79. ⟨10.1016/j.dam.2021.06.006⟩
An open neighbourhood locating-dominating set is a set S of vertices of a graph G such that each vertex of G has a neighbour in S , and for any two vertices u , v of G , there is at least one vertex in S that is a neighbour of exactly one of u and v
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::c47d53fd84d40591adc65f1498f88425
http://arxiv.org/abs/2101.05322
http://arxiv.org/abs/2101.05322
Publikováno v:
The Electronic Journal of Combinatorics. 27
The Fibonacci word $W$ on an infinite alphabet was introduced in [Zhang et al., Electronic J. Combinatorics 2017 24(2), 2-52] as a fixed point of the morphism $2i\rightarrow (2i)(2i+1)$, $(2i+1) \rightarrow (2i+2)$, $i\geq 0$. Here, for any integer $
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::0426a0c664d256cf160fba142224db14
https://doi.org/10.37236/9406
https://doi.org/10.37236/9406
Publikováno v:
Electronic Journal of Graph Theory and Applications, Vol 9, Iss 2, Pp 277-300 (2021)
Given a positive integer k and a graph G = (V, E), a function f from V to the power set of Ik is called a k-rainbow function if for each vertex v ∈ V, f(v)=∅ implies ∪u ∈ N(v)f(u)=Ik where N(v) is the set of all neighbors of vertex v and Ik =
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::a6272aa84d899293e86cbfd8374c2cf1
https://doi.org/10.5614/ejgta.2021.9.2.4
https://doi.org/10.5614/ejgta.2021.9.2.4
Autor:
Narges Ghareghani, Mohammad Reza Hooshmandasl, Reza Naserasr, Omid Etesami, Pouyeh Sharifani, Michel Habib
Publikováno v:
Theoretical Computer Science
Theoretical Computer Science, 2019, ⟨10.1016/j.tcs.2019.02.012⟩
Theoretical Computer Science, Elsevier, 2019, ⟨10.1016/j.tcs.2019.02.012⟩
Theoretical Computer Science, 2019, ⟨10.1016/j.tcs.2019.02.012⟩
Theoretical Computer Science, Elsevier, 2019, ⟨10.1016/j.tcs.2019.02.012⟩
A dominating set is a set S of vertices in a graph such that every vertex not in S is adjacent to a vertex in S. In this paper, we consider the set of all optimal (i.e. smallest) dominating sets S, and ask of the existence of at least one such set S
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::a8014ea292759278858fc3658183e58e
https://inria.hal.science/hal-02423707
https://inria.hal.science/hal-02423707