Results 41 to 50 of about 9,423,140 (336)
Discrete Mathematics, 2002 AbstractThe game domination number of a (simple, undirected) graph is defined by the following game. Two players, A and D, orient the edges of the graph alternately until all edges are oriented. Player D starts the game, and his goal is to decrease the domination number of the resulting digraph, while A is trying to increase it.
Béla Bollobás +3 more
openaire +2 more sources
The geodetic domination number of comb product graphs
Electronic Journal of Graph Theory and Applications, 2020 A subset S of vertices in graph G is called a geodetic set if every vertex in V(G) \ S lies on a shortest path between two vertices in S. A subset S of vertices in G is called a dominating set if every vertex in V(G) \ S is adjacent to a vertex in S ...
Dimas Agus Fahrudin, Suhadi Wido Saputro
doaj +1 more source
Domination cover number of graphs [PDF]
Discrete Mathematics, Algorithms and Applications, 2019 A set [Formula: see text] for the graph [Formula: see text] is called a dominating set if any vertex [Formula: see text] has at least one neighbor in [Formula: see text]. Fomin et al. [Combinatorial bounds via measure and conquer: Bounding minimal dominating sets and applications, ACM Transactions on Algorithms (TALG) 5(1) (2008) 9] gave an algorithm ...
M. Alambardar Meybodi +3 more
openaire +3 more sources
Connected cototal domination number of a graph [PDF]
Transactions on Combinatorics, 2012 A dominating set $D subseteq V$ of a graph $G = (V,E)$ is said to be a connected cototal dominating set if $langle D rangle$ is connected and $langle V-D rangle neq phi$, contains no isolated vertices.
B Basavanagoud, Sunilkumar M Hosamani
doaj
Isolate and independent domination number of some classes of graphs
AKCE International Journal of Graphs and Combinatorics, 2019 In this paper we compute isolate domination number and independent domination number of some well known classes of graphs. Also a counter example is provided, which disprove the result on independent domination for Euler Totient Cayley graph proved by ...
Shilpa T. Bhangale, Madhukar M. Pawar
doaj +1 more source
Resolving domination number of helm graph and it’s operation
Journal of Physics: Conference Series, 2020 Let G be a connected graph. Dominating set is a set of vertices which each vertex D has at least one neighbor in G. The minimum cardinality of D is called the domination number G(γ(G)).
A. N. Hayyu +4 more
semanticscholar +1 more source
Reducing the domination number of graphs via edge contractions [PDF]
International Symposium on Mathematical Foundations of Computer Science, 2019 In this paper, we study the following problem: given a connected graph $G$, can we reduce the domination number of $G$ by at least one using $k$ edge contractions, for some fixed integer $k \geq 0$?
Esther Galby, Paloma T. Lima, B. Ries
semanticscholar +1 more source
The 3-Rainbow Domination Number of the Cartesian Product of Cycles
Mathematics, 2020 We have studied the k-rainbow domination number of C n □ C m for k ≥ 4 (Gao et al. 2019), in which we present the 3-rainbow domination number of C n □ C m , which should be bounded above by the four-rainbow domination number of C n □ C m .
Hong Gao, Changqing Xi, Yuansheng Yang
semanticscholar +1 more source
Characterization of Upper Detour Monophonic Domination Number
Cubo, 2020 This paper introduces the concept of \textit{upper detour monophonic domination number} of a graph. For a connected graph $G$ with vertex set $V(G)$, a set $M\subseteq V(G)$ is called minimal detour monophonic dominating set, if no proper subset of $M ...
M. Mohammed Abdul Khayyoom
doaj +1 more source
Equitable eccentric domination in graphs
Ratio Mathematica, 2023 In this paper, we define equitable eccentric domination in graphs. An eccentric dominating set S ⊆ V (G) of a graph G(V, E) is called an equitable eccentric dominating set if for every v ∈ V − S there exist at least one vertex u ∈ V such that |d(v) − d(u)
A Riyaz Ur Rehman, A Mohamed Ismayil
doaj +1 more source