Corpus ID: 15354396

Weakly Connected Domination in Graphs Resulting from Some Graph Operations

@inproceedings{Sandueta2011WeaklyCD,
  title={Weakly Connected Domination in Graphs Resulting from Some Graph Operations},
  author={Elsie P. Sandueta and S. Canoy},
  year={2011}
}
Let G = (V (G),E(G)) be a connected undirected graph. The closed neighborhood of any vertex v ∈ V (G) is NG[v] = {u ∈ V (G) : uv ∈ E(G)} ∪ {v}. For C ⊆ V (G), the closed neighborhood of C is N [C] = ∪v∈CNG[v]. A dominating set C ⊆ V (G) is a weakly connected dominating set in G if the subgraph 〈C〉w = (NG[C], EW ) weakly induced by C is connected, where EW is the set of all edges with at least one vertex in C. The weakly connected domination number γw(G) of G is the minimum cardinality among all… CONTINUE READING
6 Citations

References

SHOWING 1-6 OF 6 REFERENCES
Connected domination critical graphs
  • 26
  • PDF
Graphs and Applications_ An Introductory Approach
  • 97
  • PDF
Weakly connected domination critical graphs, Opuscula Mathematica
  • Weakly connected domination critical graphs, Opuscula Mathematica
  • 2008
Graph Theory (Electronic Edition)
  • Graduate Texts in Mathematics
  • 2000
On weaklyconnected domination in graphs
  • On weaklyconnected domination in graphs
  • 1997