Exploració per tema "Domination"
Ara es mostren els items 1-9 de 9
-
General bounds on limited broadcast domination
(2016-09-19)
Report de recerca
Accés obertLimited dominating broadcasts were proposed as a variant of dominating broadcasts, where the broadcast function is upper bounded by a constant k . The minimum cost of such a dominating broadcast is the k -broadcast dominating ... -
Graphs attaining the upper bound on the isolation number
(Universidad de Cádiz, 2023)
Text en actes de congrés
Accés obertA set D of vertices of a graph is isolating if the set of vertices not belonging to D or not having a neighbour in D is independent. The isolation number of a graph G, denoted by ¿(G), is the minimum cardinality of an ... -
Locating domination in bipartite graphs and their complements
(2018-01-01)
Article
Accés obertA set S of vertices of a graph G is distinguishing if the sets of neighbors in S for every pair of vertices not in S are distinct. A locating-dominating set of G is a dominating distinguishing set. The location-domination ... -
Neighbor-locating colorings in graphs
(2020-02-02)
Article
Accés obertA k-coloring of a graph G is a k-partition of into independent sets, called colors. A k-coloring is called neighbor-locating if for every pair of vertices belonging to the same color , the set of colors of the neighborhood ... -
On global location-domination in bipartite graphs
(2015-06-10)
Report de recerca
Accés obert -
On global location-domination in graphs
(2015-05-29)
Article
Accés obertA dominating set S of a graph G is called locating-dominating, LD-set for short, if every vertex v not in S is uniquely determined by the set of neighbors of v belonging to S. Locating-dominating sets of minimum cardinality ... -
On k-domination and j-independence in graphs
(2013-07)
Article
Accés restringit per política de l'editorialLet GG be a graph and let kk and jj be positive integers. A subset DD of the vertex set of GG is a kk-dominating set if every vertex not in DD has at least kk neighbors in DD. The kk-domination numberγk(G)γk(G) is the ... -
On perfect and quasiperfect dominations in graphs
(2017-02-27)
Article
Accés obertA subset S ¿ V in a graph G = ( V , E ) is a k -quasiperfect dominating set (for k = 1) if every vertex not in S is adjacent to at least one and at most k vertices in S . The cardinality of a minimum k -quasiperfect ... -
Quasiperfect domination in trees
(2015-12-18)
Article
Accés obertA k–quasiperfect dominating set ( k=1k=1) of a graph G is a vertex subset S such that every vertex not in S is adjacent to at least one and at most k vertices in S. The cardinality of a minimum k–quasiperfect dominating ...