Results 21 to 30 of about 1,258,349 (257)
Computation of Various Domination Numbers of Rolf Nevanlinna (RNP) Collaboration Graph
Brazilian Archives of Biology and Technology, 2017 In this paper, we compute various Domination numbers like Outer Connected Domination (OCD), Doubly Connected Domination (DCD), Fair Domination (FD), Independence Domination (ID), 2-Packing (2-P) for Rolf Nevanlinna Prize Winners's Collaboration Graph ...
Yegnanarayanan V, Logeshwary B
doaj +1 more source
Perfect edge domination in vague graphs
Ratio Mathematica, 2021 In this paper, we modified undirected vague graphs and edge domination set based on these two concepts. We study the notions of perfect edge domination, connected perfect edge domination of vague graph. Moreover, we investigate some related properties in
M Kaliraja, P Kanibose, Abdul Ibrahim
doaj +1 more source
Connected Certified Domination In The Middle Graph Of Certain Graphs [PDF]
, 2023 A dominating set S of a graph is called a certified dominating set of G. If every vertices in S has either zero or at least two neighbours in A certified dominating set S of G is said to be connected certified dominating set if the subgraph ...
R. Aneesh, Dr. M. Deva Saroja
core +1 more source
Complexity of the game connected domination problem [PDF]
The connected domination game is a variant of the domination game where the played vertices must form a connected subgraph at all stages of the game.
Iršič Chenoweth, Vesna
core +3 more sources
Neighbourhood total domination in graphs [PDF]
Opuscula Mathematica, 2011 Let \(G = (V,E)\) be a graph without isolated vertices. A dominating set \(S\) of \(G\) is called a neighbourhood total dominating set (ntd-set) if the induced subgraph \(\langle N(S)\rangle\) has no isolated vertices.
S. Arumugam, C. Sivagnanam
doaj +1 more source
Connected power domination number of product graphs [PDF]
, 2022 In this paper, we consider the connected power domination number ($\gamma_{P, c}$) of three standard graph products. The exact value for $\gamma_{P, c}(G\circ H)$ is obtained for any two non-trivial graphs $G$ and $H.$ Further, tight upper bounds are ...
Ganesamurthy, S. +2 more
core
Algorithm and Hardness Results for Outer-connected Dominating Set in Graphs
Journal of Graph Algorithms and Applications, 2014 A set D ⊆ V of a graph G = (V,E) is called an outer-connected dominating set of G if for all v ∈ V, |NG[v]∩D| ≥ 1, and the induced subgraph of G on V\D is connected.
B. Panda, Arti Pandey
doaj +1 more source
[1,2] -Connected domination number of graphs
, 2021 A set in a graph G is said to be a -connected dominating set if for every vertex , and is connected. The minimum cardinality of a -connected dominating set is called the -connected domination number and is denoted by .
et. al., G. Mahadevan,
core +1 more source
Connected Vertex-Edge Dominating Sets and Connected Vertex-Edge Domination Polynomials of Friendship F_n [PDF]
, 2023 Let be a simple connected graph of order Let be the family of connected vertex-edge dominating sets in with cardinality .The polynomial is called the connected vertex - edge domination polynomial of G, where is the number of connected vertex - edge ...
Devendra Jangiti +2 more
core +1 more source
Progress on Roman and Weakly Connected Roman Graphs
Mathematics, 2021 A graph G for which γR(G)=2γ(G) is the Roman graph, and if γRwc(G)=2γwc(G), then G is the weakly connected Roman graph. In this paper, we show that the decision problem of whether a bipartite graph is Roman is a co-NP-hard problem. Next, we prove similar
Joanna Raczek, Rita Zuazua
doaj +1 more source