CO- Total 2- Oded Number in Graphs
Let D be a subset of V and the out degree of u is defined by ) and denoted by A dominating set D of V is said to be co- total dominating set if the sub graph induced by has no isolated vertices Based on the concepts we introduce a new domination called co-total 2 - ODED number. Here the proposed domination number verified for some general and some named graphs.
Authors
- V. Maheswari T. Sindhuja
Publication Details
- Journal
- Communications on Applied Nonlinear Analysis
- Published
- 2025-02-26
- DOI
- https://doi.org/10.52783/cana.v32.4037
- Primary Topic
- Graph Labeling and Dimension Problems
- Type
- article
- Field-Weighted Citation Impact
- 0.00