Zobrazeno 1 - 10
of 26
pro vyhledávání: '"Adel P. Kazemi"'
Publikováno v:
AKCE International Journal of Graphs and Combinatorics, Vol 19, Iss 3, Pp 229-237 (2022)
AbstractFor a graph [Formula: see text] we call a subset [Formula: see text] a total mixed dominating set of G if each element of [Formula: see text] is either adjacent or incident to an element of S, and the total mixed domination number of G is the
Externí odkaz:
https://doaj.org/article/72d19692b4c64c4885e8658329c36bd4
Publikováno v:
AKCE International Journal of Graphs and Combinatorics, Vol 18, Iss 3, Pp 127-131 (2021)
Let S be a set of vertices of a graph G. Let be the set of vertices built from the closed neighborhood of S, by iteratively applying the following propagation rule: if a vertex and all but exactly one of its neighbors are in then the remaining neighb
Externí odkaz:
https://doaj.org/article/f38003b888e94e909f8b584c2f26b015
Autor:
Adel P. Kazemi
Publikováno v:
Transactions on Combinatorics, Vol 4, Iss 2, Pp 57-68 (2015)
Given a graph $G$, the total dominator coloring problem seeks a proper coloring of $G$ with the additional property that every vertex in the graph is adjacent to all vertices of a color class. We seek to minimize the number of color classes. We in
Externí odkaz:
https://doaj.org/article/0e1d7f8a981f45f99823e2c4337dacfa
Autor:
Adel P. Kazemi
Publikováno v:
Transactions on Combinatorics, Vol 1, Iss 1, Pp 7-13 (2012)
Let $k$ be a positive integer. A subset $S$ of $V(G)$ in a graph $G$ is a $k$-tuple total dominating set of $G$ if every vertex of $G$ has at least $k$ neighbors in $S$. The $k$-tuple total domination number $gamma _{times k,t}(G)$ of $G$ is the mini
Externí odkaz:
https://doaj.org/article/d5e3f0e81b9e4f64961cf8dfa3ae27de
Autor:
Michael A. Henning, Adel P. Kazemi
Publikováno v:
Quaestiones Mathematicae; Vol. 44 No. 8 (2021); 1023-1036
For k ≥ 1 an integer, a set S of vertices in a graph G with minimum degree at least k − 1 is a k-tuple dominating set of G if every vertex of S is adjacent to at least k − 1 vertices in S and every...
Publikováno v:
AKCE International Journal of Graphs and Combinatorics, Vol 18, Iss 3, Pp 127-131 (2021)
UPCommons. Portal del coneixement obert de la UPC
Universitat Politècnica de Catalunya (UPC)
UPCommons. Portal del coneixement obert de la UPC
Universitat Politècnica de Catalunya (UPC)
Let S be a set of vertices of a graph G. Let M[S] be the set of vertices built from the closed neighborhood N[S] of S, by iteratively applying the following propagation rule: if a vertex and all but exactly one of its neighbors are in M[S], then the
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::b945dfe56e3743cd718b031a41614d0a
https://hdl.handle.net/2117/367714
https://hdl.handle.net/2117/367714
Autor:
Adel P. Kazemi, Farshad Kazemnejad
The total dominator total coloring of a graph is a total coloring of the graph such that each object of the graph is adjacent or incident to every object of some color class. The minimum namber of the color classes of a total dominator total coloring
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::4f34c89b514e13943390b73d95f947ad
http://arxiv.org/abs/1912.01402
http://arxiv.org/abs/1912.01402
Publikováno v:
Filomat. 32:6713-6731
A $k$-tuple total dominating set ($k$TDS) of a graph $G$ is a set $S$ of vertices in which every vertex in $G$ is adjacent to at least $k$ vertices in $S$; the minimum size of a $k$TDS is denoted $\gamma_{\times k,t}(G)$. We give a Vizing-like inequa
Autor:
Adel P. Kazemi
Publikováno v:
Pure and Applied Mathematics Quarterly. 13:563-579
Let $G=(V,E)$ be a simple graph. For any integer $k\geq 1$, a subset of $V$ is called a $k$-tuple total dominating set of $G$ if every vertex in $V$ has at least $k$ neighbors in the set. The minimum cardinality of a minimal $k$-tuple total dominatin
Autor:
Adel P. Kazemi
Publikováno v:
ISRN Combinatorics. 2013:1-6
In a graph with , a -tuple total restrained dominating set is a subset of such that each vertex of is adjacent to at least vertices of and also each vertex of is adjacent to at least vertices of . The minimum number of vertices of such sets in is the