Zobrazeno 1 - 10
of 101
pro vyhledávání: '"A. Poureidi"'
Autor:
N. Jafari Rad, A. Poureidi
Publikováno v:
Communications in Combinatorics and Optimization, Vol 4, Iss 2, Pp 201-208 (2019)
Let $G=(V,E)$ be a graph. A subset $S\subset V$ is a hop dominating set if every vertex outside $S$ is at distance two from a vertex of $S$. A hop dominating set $S$ which induces a connected subgraph is called a connected hop dominating set of $
Externí odkaz:
https://doaj.org/article/044ebf76298d47eab5549f60507234a4
Publikováno v:
Computer Science Journal of Moldova, Vol 27, Iss 1(79), Pp 3-22 (2019)
A subset $S$ of vertices of a graph $G$ is a hop dominating set if every vertex outside $S$ is at distance two from a vertex of $S$. A Roman dominating function on a graph $G=(V,E)$ is a function $f: V(G) \longrightarrow \{0, 1, 2\}$ satisfying th
Externí odkaz:
https://doaj.org/article/0c66a906a2214b348262954619b20aff
A subset $S$ of vertices in a graph $G=(V, E)$ is a Dominating Set if each vertex in $V(G)\setminus S$ is adjacent to at least one vertex in $S$. Chellali et al. in 2013, by restricting the number of neighbors in $S$ of a vertex outside $S$, introduc
Externí odkaz:
http://arxiv.org/abs/2403.04694
Autor:
Poureidi, Abolfazl1 a.poureidi@shahroodut.ac.ir, Fathali, Jafar1 fathali@shahroodut.ac.ir
Publikováno v:
Communications in Combinatorics & Optimization. 2024, Vol. 9 Issue 2, p217-232. 16p.
Autor:
Poureidi, Abolfazl, Farshi, Mohammad
Publikováno v:
In Computational Geometry: Theory and Applications February 2024 117
Autor:
Poureidi, Abolfazl, Farshi, Mohammad
Publikováno v:
In Discrete Applied Mathematics 31 July 2023 334:36-44
Autor:
Poureidi, Abolfazl
Publikováno v:
In Discrete Applied Mathematics 31 May 2023 331:138-146
Autor:
Poureidi Abolfazl, Rad Nader Jafari
Publikováno v:
Discussiones Mathematicae Graph Theory, Vol 42, Iss 3, Pp 709-726 (2022)
A 2-rainbow dominating function (2RDF) of a graph G is a function g from the vertex set V (G) to the family of all subsets of {1, 2} such that for each vertex v with g(v) =∅ we have ∪u∈N(v) g(u) = {1, 2}. The minimum of g(V (G)) = Σv∈V (G) |
Externí odkaz:
https://doaj.org/article/e3040e5778064b5f9ee3da431396b09e
Autor:
Poureidi, Abolfazl1 a.poureidi@shahroodut.ac.ir
Publikováno v:
Communications in Combinatorics & Optimization. 2023, Vol. 8 Issue 3, p491-503. 13p.
Autor:
Poureidi, Abolfazl, Farshi, Mohammad
Given a real number $t>1$, a geometric $t$-spanner is a geometric graph for a point set in $\mathbb{R}^d$ with straight lines between vertices such that the ratio of the shortest-path distance between every pair of vertices in the graph (with Euclide
Externí odkaz:
http://arxiv.org/abs/1706.06287