Accurate Connected Domination in Graphs (ACD)

View at publisher Summarise with VIRAT
Authors: P. M. Sudha, S. Meenakshi
Cited by: 0

Summary

No summary yet. VIRAT can read this paper and write a plain-language summary of its aim, methods, key findings and limitations.

Summarise with VIRAT Free to try with your Science Catalogs account.

Abstract

If V-D does not have a dominating set of cardinality D, then a graph G’s dominating set D is an accurate dominating set. If the < D > is connected, then it is considered as an ACDS. An ACD number γ ac ( G ) represents the ACDS’s minimum cardinality. we investigated the new parameters, bounds, and precise values for γ ac ( G ). Also got the results for a few common graphs.

Fields of Study & Subjects

Advanced Graph Theory Research Graph Labeling and Dimension Problems Complexity and Algorithms in Graphs

Publication details

Journal / source
CRC Press eBooks
Pages
427–430
Publication date
31 March 2026
Language
EN
Document type
Book chapter