Accurate Connected Domination Number of Middle Graphs and Central Graphs of Some Families of Graphs

Abstract

A set D be a connected dominating set if the chosen sub graph G is connected and V −D do not have a , then a G′s dominating set D is an accurate connected domination. An ACD number  represents the ACDS’s minimum cardinality. This paper we find the accurate connected domination of central graph  and middle graph  for the new parameters, and precise values for some standard graphs.