Results 31 to 40 of about 9,666,055 (254)

Tadpole Domination in Graphs

مجلة بغداد للعلوم, 2018
A new type of the connected domination parameters called tadpole domination number of a graph is introduced. Tadpole domination number for some standard graphs is determined, and some bounds for this number are obtained. Additionally, a new graph, finite,
Baghdad Science Journal
doaj   +1 more source

The Number of Minimum Dominating Sets in Pn × P2 [PDF]

, 2010
A set S of vertices in a graph G is said to be a Smarandachely k-dominating set if each vertex of G is dominated by at least k vertices of S.
Kishori P. Narayankar, Shirakol, Shailaja S., Shailaja S. Shirakol, H.B.Walikar, Narayankar, Kishori P., H. B. Walikar   +5 more
core   +1 more source

Algorithmic approach, mathematical modelling and network applications of connected certified domination in graphs: A comprehensive review [PDF]

EPJ Web of Conferences
In this study we have reviewed a very important variant of graph domination theory that is connected certified domination (CCD) and also presents CCD as graph-based model for network optimization.
Nehe Reshma, Menon Radhika, Goswami Vishwajeet   +2 more
doaj   +1 more source

The Forcing Geodetic Cototal Domination Number of a Graph

Ratio Mathematica, 2022
Let  be a geodetic cototal domination set of . A subset  is called a forcing subset for  if  is the unique minimum geodetic cototal domination set containing . The minimum cardinality T is the forcing geodetic cototal domination number of S is denotedby ,
S L Sumi, V Mary Gleeta, J Befija Minnie
doaj   +1 more source

Domination Analysis of Greedy Heuristics For The Frequency Assignment Problem [PDF]

, 2003
We introduce the greedy expectation algorithm for the fixed spectrum version of the frequency assignment problem. This algorithm was previously studied for the travelling salesman problem.
Noble, SD, Noble, Steven, A.E. Koller, Koller, A.E., Noble, S.D., S.D. Noble, Koller, AE   +6 more
core   +1 more source

Alternative Domination in Graphs

AKCE International Journal of Graphs and Combinatorics
Sometimes while you are using the Internet, for example, via a Wi-Fi network from one of the companies, the Internet is suddenly cut off due to a malfunction at that point, which disrupts your important work on the Internet, so there is a need for ...
Ali Mohammed Sahal
doaj   +1 more source

When the connected domination number is at most the total domination number [PDF]

, 2011
In this note we give a finite forbidden subgraph characterization of the connected graphs for which any non-trivial connected induced subgraph has the property that the connected domination number is at most the total domination number.
Schaudt, Oliver
core   +2 more sources

Total outer-connected domination number of middle graphs [PDF]

, 2023
In this paper, we study the total outer-connected domination number of the middle graph of a simple graph and we obtain tight bounds for this number in terms of the order of the middle graph. We also compute the total outer-connected domination number of
Kazemnejad, Farshad, Torielli, Michele, Palezzato, Elisa, Pahlavsay, Behnaz   +3 more
core  

Weakly convex and convex domination numbers [PDF]

Opuscula Mathematica, 2004
Two new domination parameters for a connected graph \(G\): the weakly convex domination number of \(G\) and the convex domination number of \(G\) are introduced. Relations between these parameters and the other domination parameters are derived.
Magdalena Lemańska
doaj  

Forcing Parameters in Fully Connected Cubic Networks

Mathematics, 2022
Domination in graphs has been extensively studied and adopted in many real life applications. The monitoring electrical power system is a variant of a domination problem called power domination problem.
Yongsheng Rao, Saeed Kosari, Janakiraman Anitha, Indra Rajasingh, Hossein Rashmanlou   +4 more
doaj   +1 more source