Corpus ID: 119155197

Split Domination, Independence, and Irredundance in Graphs

@inproceedings{Hedetniemi2016SplitDI,
  title={Split Domination, Independence, and Irredundance in Graphs},
  author={Stephen T. Hedetniemi and Fiona Knoll and Renu C. Laskar},
  year={2016}
}
In 1997, Kulli and Janakiram [4] defined the split dominating set: a dominating set S of vertices in a graph G = (V,E) is called split dominating if the induced subgraph 〈V \ S〉 is either disconnected or a K1. In this paper we introduce the properties split independence and split irredundance. A set S of vertices in a graph G = (V,E) is called a split independent set if S is independent and the induced subgraph 〈V \ S〉 is either disconnected or a K1. A set S of vertices in a graph G = (V,E) is… Expand

Figures from this paper

References

SHOWING 1-9 OF 9 REFERENCES
Properties of hereditary hypergraphs and middle graphs
The middle graph of a graph G ( V, E) is the graph M{G) = (VUE, E'), in which two vertices u, v are adjacent if either M is a vertex in V and v is an edge in E containing u, or u and v are edges in EExpand
The split domination number of a prism graph.
A dominating set D of a graph is a split dominating set if the induced subgraph of is disconnected. The split domination number is the minimum cardinality of split dominating set of a graph G. InExpand
A note on split domination number of a graph
Abstract A dominating set D of a graph G is a split dominating set if the induced subgraph is disconnected. The split domination number γ s (G) is the minimum cardinality of a split dominating set.Expand
Fundamentals of domination in graphs
Bounds on the domination number domination, independence and irredundance efficiency, redundancy and the duals changing and unchanging domination conditions on the dominating set varieties ofExpand
The nonsplit domination number of a graph
  • Indian Journal of Pure Applied Mathematics,
  • 2000
The Inverse Split and Non-split Domination in Graphs
TLDR
In paper, the notions of inverse split and non split domination in graphs are defined and many bounds on inversesplit and nonsplit domination numbers are obtained. Expand
Tamizh Chelvam and S . Robinson Chellathurai . A note on split domination number of a graph
  • Journal of Discrete Mathematical Sciences and Cryptography
  • 2009
The strong split domination number of a graph
  • Acta Ciencia Indica
  • 2006
The strong split domination number of a graph
  • Acta Ciencia Indica,
  • 2006