Results 261 to 270 of about 1,217,256 (282)
Some of the next articles are maybe not open access.
CONNECTED SUPER DOMINATION IN GRAPHS
Advances and Applications in Discrete Mathematics, 2018Summary: Let \(G\) be a simple graph. A set \(S\subseteq V(G)\) is a connected super dominating set if for every \(v\in V(G)\backslash S\), there exists an external private neighbor of \(v\) with respect to \(S\) and the subgraph \(\langle S\rangle\) induced by \(S\) is connected. The connected super domination number of \(G\), denoted by \(\gamma_{csp}
Liguarda, Remilou F. +1 more
openaire +2 more sources
Connected monophonic domination in graphs
Discrete Mathematics, Algorithms and Applications, 2020A collection of vertices in different connected graphs embraces a wholesome shift into a new collection with the properties of the couplets monophonic and dominating sets. The new collection of vertices and associated invariant with the new behavior of connected graphs are called as connected monophonic dominating set (cmd-set) and connected ...
A. Sadiquali +2 more
openaire +2 more sources
On the outer-connected domination in graphs
Journal of Combinatorial Optimization, 2011zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Mohammad Hadi Akhbari +4 more
openaire +3 more sources
Domination and Outer Connected Domination in Maximal Outerplanar Graphs
Graphs and Combinatorics, 2021zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire +2 more sources
Connected Fair Domination in Graphs
2017In this paper, we introduce the notion of connected fair domination in graphs. A connected fair dominating set in a graph G (or \(\mathsf {CFD}\)-set) is a dominating set S such that \(\langle S \rangle \) is connected in G and all vertices not in S are dominated by the same number of vertices from S, i.e., every two vertices not in S has the same ...
Angsuman Das, Wyatt J. Desormeaux
openaire +2 more sources
Total and connected domination in digraphs
Australas. J Comb., 2007Summary: Let \(D= (V,A)\) be a digraph. A subset \(S\) of \(V\) is called a dominating set of \(D\) if for every vertex \(v\in V- S\), there exists a vertex \(u\in S\) such that \((u,v)\in A\). A dominating set \(S\) is called a total dominating set if the induced subdigraph \(\langle S\rangle\) has no isolated vertices. It is called an open dominating
S. Arumugam 0001 +2 more
openaire +2 more sources
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
An inequality on connected domination parameters
Ars Comb., 1998A subset \(S\) of the vertex set \(V(G)\) of a graph \(G\) is dominating in \(G\), if each vertex of \(G\) either is in \(S\), or is adjacent to a vertex of \(S\). If moreover the subgraph of \(G\) induced by \(S\) is connected, \(S\) is called a connected dominating set in \(G\). The minimum number of vertices of a connected dominating set in \(G\) is
Hongquan Yu, Tianming Wang
openaire +2 more sources
Connecting domination contracts
Ethnic and Racial Studies, 2017In Black Rights/White Wrongs, Charles Mills continues his critique of contemporary American political philosophy for ignoring issues of racial oppression, and in particular for ignoring the way tha...
openaire +1 more source