Results 31 to 40 of about 1,258,349 (257)
Domination Parameters of a Graph and its Complement
A dominating set in a graph G is a set S of vertices such that every vertex in V (G) \ S is adjacent to at least one vertex in S, and the domination number of G is the minimum cardinality of a dominating set of G.
Desormeaux Wyatt J. +2 more
doaj +1 more source
Algorithmic approach, mathematical modelling and network applications of connected certified domination in graphs: A comprehensive review [PDF]
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 +2 more
doaj +1 more source
In this paper, we study a new distance parameter triameter of a connected graph G, which is defined as max{d(u; v)+d(v;w)+d(u;w) : u; v;w ∈ V }and is denoted by tr(G).
Das Angsuman
doaj +1 more source
Steiner domination decomposition number of graphs
In this paper, we introduce a new concept Steiner domination decomposition number of graphs. Let be a connected graph with Steiner domination numberA decomposition of is said to be a Steiner Domination Decomposition if Steiner domination ...
M Mahiba, E Ebin Raja Merly
doaj +1 more source
Resolving connected domination in graphs [PDF]
For an ordered subset W = w1,w2, · · · ,wk of vertices and a vertex v in a connected graph G = (V,E), the (metric) representation of v with respect to W is the k-vector r(v|W) = (d(v,w1), d(v,w2), · · · , d(v,wk)).
Soner, N. D. +8 more
core +1 more source
On domination multisubdivision number of unicyclic graphs [PDF]
The paper continues the interesting study of the domination subdivision number and the domination multisubdivision number. On the basis of the constructive characterization of the trees with the domination subdivision number equal to 3 given in [H. Aram,
Joanna Raczek
doaj +1 more source
Connected Domination Critical Graphs with Cut Vertices
A graph G is said to be k- γc-critical if the connected domination number of G, γc(G), is k and γc(G + uv) < k for any pair of non-adjacent vertices u and v of G. Let G be a k-γc-critical graph and ζ (G) the number of cut vertices of G. It was proved, in
Kaemawichanurat Pawaton +1 more
doaj +1 more source
Algorithmic Aspects of Secure Connected Domination in Graphs
Let G = (V, E) be a simple, undirected and connected graph. A connected dominating set S ⊆ V is a secure connected dominating set of G, if for each u ∈ V \ S, there exists v ∈ S such that (u, v) ∈ E and the set (S \ {v}) ∪ {u} is a connected dominating ...
Kumar Jakkepalli Pavan +1 more
doaj +1 more source
ABSTRACT Background Therapeutic apheresis (TA) is an established treatment modality for hematologic, neurologic, and immunologic disorders, yet access remains severely limited in sub‐Saharan Africa. Donor apheresis, including platelet apheresis collection from healthy donors, represents an important complementary modality supporting blood product ...
Nosa Bazuaye +33 more
wiley +1 more source
Connected and outer-connected domination number of middle graphs
In this paper, we study the notions of connected domination number and of outer-connected domination number for middle graphs. Indeed, we obtain tight bounds for this number in terms of the order of the graph M(G).
Kazemnejad, Farshad +3 more
core

