Results 11 to 20 of about 9,423,140 (336)
The Domination Parameters on a kind of the regular honeycomb structure [PDF]
Computer Science Journal of Moldova, 2022 The honeycomb mesh, based on hexagonal structure, has enormous applications in chemistry and engineering. A major challenge in this field is to understand the unique properties of honeycomb structures, which depend on their properties of topology. One
Fateme Movahedi +2 more
doaj +1 more source
The total co-independent domination number of some graph operations
Revista de la Unión Matemática Argentina, 2022 . A set D of vertices of a graph G is a total dominating set if every vertex of G is adjacent to at least one vertex of D . The total domi- nating set D is called a total co-independent dominating set if the subgraph induced by V ( G ) − D is edgeless ...
A. Cabrera Martínez +3 more
semanticscholar +1 more source
On the outer-independent double Italian domination number
Electronic Journal of Graph Theory and Applications, 2022 An outer-independent Italian dominating function (OIIDF) on a graph G is a function f : V ( G ) −→ { 0 , 1 , 2 } such that every vertex v ∈ V ( G ) with f ( v ) = 0 has at least two neighbors assigned 1 under f or one neighbor w with f ( w ) = 2 , and ...
Noor A'lawiah Abd Aziz +3 more
semanticscholar +1 more source
Medium Domination Decomposition of Graphs
Ratio Mathematica, 2022 A set of vertices in a graph dominates if every vertex in is either in or adjacent to a vertex in . The size of any smallest dominating set is called domination number of .
E Ebin Raja Merly, Saranya J
doaj +1 more source
On the domination search number [PDF]
Discrete Applied Mathematics, 2000 We introduce the domination search game which can be seen as a natural modification of the well-known node search game. Various results concerning the domination search number of a graph are presented. In particular, we establish a very interesting connection between domination graph searching and a relatively new graph parameter called dominating ...
Dieter Kratsch +2 more
openaire +2 more sources
Further results on the total Italian domination number of trees
AIMS Mathematics, 2023 Let $ f:V(G)\rightarrow \{0, 1, 2\} $ be a function defined from a connected graph $ G $. Let $ W_i = \{x\in V(G): f(x) = i\} $ for every $ i\in \{0, 1, 2\} $. The function $ f $ is called a total Italian dominating function on $ G $ if $ \sum_{v\in N(x)}
Abel Cabrera-Martínez +2 more
doaj +1 more source
Closed formulas for the total Roman domination number of lexicographic product graphs
Ars Math. Contemp., 2021 Let G be a graph with no isolated vertex and f : V ( G ) → {0, 1, 2} a function. Let V i = { x ∈ V ( G ) : f ( x ) = i } for every i ∈ {0, 1, 2} . We say that f is a total Roman dominating function on G if every vertex in V 0 is adjacent to at least
Abel Cabrera Martínez +1 more
semanticscholar +1 more source
New Bounds on the Double Total Domination Number of Graphs
Bulletin of the Malaysian Mathematical Sciences Society, 2021 Let G be a graph of minimum degree at least two. A set $$D\subseteq V(G)$$ D ⊆ V ( G ) is said to be a double total dominating set of G if $$|N(v)\cap D|\ge 2$$ | N ( v ) ∩ D | ≥ 2 for every vertex $$v\in V(G)$$ v ∈ V ( G ) .
A. Cabrera-Martínez +1 more
semanticscholar +1 more source
The Domination Number of Grids [PDF]
SIAM Journal on Discrete Mathematics, 2011 12 pages, 4 ...
Gonçalves, Daniel +3 more
openaire +4 more sources
The Roman domination number of some special classes of graphs - convex polytopes
Applicable Analysis and Discrete Mathematics, 2021 In this paper we study the Roman domination number of some classes of planar graphs - convex polytopes: An, Rn and Tn. We establish the exact values of Roman domination number for: An, R3k, R3k+1, T8k, T8k+2, T8k+3, T8k+5 and T8k+6.
Aleksandar Kartelj +3 more
semanticscholar +1 more source