Results 41 to 50 of about 10,021,129 (363)
Analele Stiintifice ale Universitatii Ovidius Constanta: Seria Matematica, 2015 Let G = (V;E) be a graph. A set S ⊂ V (G) is a hop dominating set of G if for every v ∈ V - S, there exists u ∈ S such that d(u; v) = 2. The minimum cardinality of a hop dominating set of G is called a hop domination number of G and is denoted by γh(G ...
Natarajan C., Ayyaswamy S.K.
doaj +1 more source
AKCE International Journal of Graphs and Combinatorics, 2020 Let be a graph and let be a family of subsets of such that A dominating set of is called an -dominating set if for all The minimum cardinality of an -dominating of is called the -domination number of and is denoted by In this paper we present several ...
Manju Raju +3 more
doaj +1 more source
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
On the Total Outer k-Independent Domination Number of Graphs
Mathematics, 2020 A set of vertices of a graph G is a total dominating set if every vertex of G is adjacent to at least one vertex in such a set. We say that a total dominating set D is a total outer k-independent dominating set of G if the maximum degree of the subgraph ...
A. Cabrera-Martínez +3 more
semanticscholar +1 more source
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
All graphs with paired-domination number two less than their order [PDF]
Opuscula Mathematica, 2013 Let \(G=(V,E)\) be a graph with no isolated vertices. A set \(S\subseteq V\) is a paired-dominating set of \(G\) if every vertex not in \(S\) is adjacent with some vertex in \(S\) and the subgraph induced by \(S\) contains a perfect matching.
Włodzimierz Ulatowski
doaj +1 more source
On resolving domination number of special family of graphs
Journal of Physics: Conference Series, 2020 Let G be a simple, finite, and connected graph. A dominating set D is a set of vertices such that each vertex of G is either in D or has at least one neighbor in D.
Y. Wangguway +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
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
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