Results 231 to 240 of about 4,392 (255)
Some of the next articles are maybe not open access.
The connected monophonic eccentric domination number of a graph
Journal of Intelligent & Fuzzy Systems, 2022A set S ⊆ V in a graph G is a MED-set if every vertex in V - S has a monophonic eccentric vertex in S. The MED-number γme (G) is the cardinality of a minimum MED-set of G. A set S ⊆ V in a graph G is a CMED-set if S is a MED-set and the induced subgraph is connected. The CMED-number γcme (G) is the cardinality of a minimum CMED-set of G. We investigate
P. Titus +3 more
openaire +1 more source
International Journal of Mathematics Trends and Technology, 2015
The concept of connectedness plays crucial role in any meshing. A variety of connectedness has been studied in the literature by considering the existence of a path between any two vertices. A communication network in which a communicating node can send a message to two stations at one stretch will be more effective and economic.
Maneesha Sakalle, Richa Jain
openaire +1 more source
The concept of connectedness plays crucial role in any meshing. A variety of connectedness has been studied in the literature by considering the existence of a path between any two vertices. A communication network in which a communicating node can send a message to two stations at one stretch will be more effective and economic.
Maneesha Sakalle, Richa Jain
openaire +1 more source
2-(Edge-)Connected Edge Domination Number and Matching Number
Graphs and Combinatorics, 2023zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Hengzhe Li, Ankang Wei, Shenggui Zhang
openaire +2 more sources
On the forcing connected domination number of a graph
Journal of Discrete Mathematical Sciences and Cryptography, 2017AbstractBy a connected simple graph G = (V, E), a subset D ⊆ V is mentioned as connected dominating set of the graph G, if whose is connected. The minimum cardinality of a connected dominating set is connected domination number. It is denoted by γc(G). For a minimum connected dominating set D of V a subset T ⊆ D is called forcing subset for D if D is
J John
exaly +2 more sources
TOTAL OUTER-CONNECTED DOMINATION SUBDIVISION NUMBERS IN GRAPHS
Discrete Mathematics, Algorithms and Applications, 2013A set S of vertices of a graph G is a total outer-connected dominating set if every vertex in V(G) is adjacent to some vertex in S and the subgraph G[V\S] induced by V\S is connected. The total outer-connected domination numberγ toc (G) is the minimum size of such a set.
Odile Favaron +2 more
openaire +4 more sources
On the Connected Domination Number of Random Regular Graphs
2002A connected dominating set (CDS) of a graph, G, is a set of vertices, C ? V (G), such that every vertex in V (G) \ C is incident to at least one vertex of C in G and the subgraph induced by the vertices of C in G is connected. In this paper we consider a simple, yet efficient, randomised greedy algorithm for finding a small CDS of regular graphs.
William Duckworth, Bernard Mans
openaire +1 more source
(1,2)-Rainbow Connection Number and Connected Dominating Sets
Journal of Interconnection NetworksIn this paper, we first show that for every connected graph [Formula: see text], the [Formula: see text]-rainbow connection number [Formula: see text] is upper bounded by [Formula: see text], where [Formula: see text] is a connected two-way dominating set of [Formula: see text]. As corollaries, we obtain some upper bounds of [Formula: see text]-rainbow
Yingbin Ma, Yuyu Zhao
openaire +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. This question is motivated by the fact that any connected dominating set of size at least 2 is in particular a total ...
openaire
Graphs with same domination and connected domination number: A review
AIP Conference Proceedings, 2023Kamaljit Kaur Bhagwat +1 more
openaire +1 more source
On the connected and weakly convex domination numbers
Journal of Combinatorial Mathematics and Combinatorial Computing, 2020In this paper we study relations between connected and weakly convex domination numbers. We show that in general the difference between these numbers can be arbitrarily large and we focus on the graphs for which a weakly convex domination number equals a connected domination number.
openaire