Corpus ID: 173987340

TOTAL DOMINATION INTEGRITY OF GRAPHS

@inproceedings{Besirik2019TOTALDI,
  title={TOTAL DOMINATION INTEGRITY OF GRAPHS},
  author={Ayse Besirik},
  year={2019}
}
  • Ayse Besirik
  • Published 2019
  • Domination concept has been widely used in fields such as Science, Technology, Engineering, Communication Networks, etc. Total domination is one of well-known domination concepts. Integrity is also another important parameter in network design. A subset S of V (G) is called a total dominating set (TD-set) if every vertex of G is adjacent to some vertex in S. In this paper, the concept of total domination integrity is introduced as a new parameter of vulnerability and some properties, bounds and… CONTINUE READING

    Figures from this paper.

    References

    Publications referenced by this paper.
    SHOWING 1-10 OF 16 REFERENCES
    Towards a theory of domination in graphs
    • 472
    • Open Access
    A survey of selected recent results on total domination in graphs
    • 219
    • Open Access
    Some New Results on Domination Integrity of Graphs
    • 8
    • Open Access
    Integrity in Graphs : Bounds and Basics
    • 17
    • Open Access
    COMPUTATIONAL COMPLEXITY OF DOMINATION INTEGRITY IN GRAPHS
    • 5
    • Open Access
    Domination integrity of some graph classes
    • 1
    • Open Access
    A Survey of Integrity
    • 74
    • Highly Influential
    • Open Access
    Domination Integrity of Splitting Graph of Path and Cycle
    • 7
    • Open Access
    DOMINATION INTEGRITY OF TOTAL GRAPHS
    • 4
    • Highly Influential
    • Open Access