Results 231 to 240 of about 13,115 (262)

A note on domination and total domination in prisms

Journal of Combinatorial Optimization, 2017
Let \(G=(V,E)\) be a simple graph. A subset \(S \subseteq V\) is a dominating set if every vertex \(v \in V\setminus S\) is adjacent to a vertex in S. The minimum cardinality of a dominating set, denoted by \(\gamma(G)\), called the domination number of graph \(G\).
Wayne Goddard, Michael A. Henning
openaire   +2 more sources

Total Dominator Colorings and Total Domination in Graphs

Graphs and Combinatorics, 2014
Given a graph \(G\), a total dominator coloring is a proper coloring of the vertices of \(G\) in which each vertex is adjacent to every vertex of some color class. The total dominator chromatic number \(\chi_{d}^{t}(G)\) of \(G\) is the minimum number of colors among all total dominator colorings of \(G\). A total dominating set of \(G\) is a set \(S\)
openaire   +1 more source

Domination and total domination in complementary prisms

Journal of Combinatorial Optimization, 2008
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Teresa W. Haynes, Michael A. Henning, Lucas C. van der Merwe   +2 more
openaire   +2 more sources

Domination and Total Domination in Hypergraphs

2020
A dominating set in a hypergraph H with vertex set V (H) and E(H) is a subset of vertices D ⊆ V (H) such that for every vertex v ∈ V (H) ∖ D, there exists an edge e ∈ E(H) for which v ∈ e and e ∩ D≠∅. A total dominating set in H is a dominating set D of H with the additional property that for every vertex v in D, there exists an edge e ∈ E(H) for which
Henning, Michael A., Yeo, Anders
openaire   +2 more sources

Girth and Total Domination in Graphs

Graphs and Combinatorics, 2011
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Michael A. Henning, Anders Yeo
openaire   +2 more sources

Total edge–vertex domination

RAIRO - Theoretical Informatics and Applications, 2020
An edge e ev-dominates a vertex v which is a vertex of e, as well as every vertex adjacent to v. A subset D ⊆ E is an edge-vertex dominating set (in simply, ev-dominating set) of G, if every vertex of a graph G is ev-dominated by at least one edge of D.
Abdulgani Sahin, Bünyamin Sahin
openaire   +3 more sources

On double edge-domination and total domination of trees

Journal of Intelligent & Fuzzy Systems, 2021
In a graph G, a vertex v is dominated by an edge e, if e is incident with v or e is incident with a vertex which is a neighbor of v. An edge-vertex dominating set D is a subset of the edge set of G such that every vertex of G is edge-vertex dominated by an edge of D.
Bünyamin Sahin, Abdulgani Sahin
openaire   +2 more sources

Relating the total \(\{2\}\)-domination number with the total domination number of graphs

Discret. Appl. Math., 2023
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Ismael Ríos Villamar, Abel Cabrera Martínez, J. L. Sánchez, José María Sigarreta   +3 more
openaire   +2 more sources

Total domination in graphs

Ars Comb., 1996
A total dominating set in a graph \(G\) is a subset \(D\) of the vertex set \(V(G)\) of \(G\) with the property that for each vertex \(x\in V(G)\) there exists a vertex \(y\in D\) adjacent to \(x.\) The minimum number of vertices of a total dominating set in \(G\) is the total domination number \(\gamma _t(G)\) of \(G.\) The symbol \(\overline G ...
S. Arumugam, A. Thuraiswamy
openaire   +1 more source

Total Domination Edge Critical Graphs with Total Domination Number Three and Many Dominating Pairs

Graphs and Combinatorics, 2014
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Camino Balbuena, Adriana Hansberg, Teresa W. Haynes, Michael A. Henning   +3 more
openaire   +2 more sources