A Note on Outer Connected Accurate Domination Number of a Graph

Abstract

An outer connected dominating set ???? of ???? is called an outer connected accurate dominating set if ????\???? has no outer connected accurate dominating set of cardinality |????|. The outer connected accurate domination number ???????????????? (????) of ???? is the minimum cardinality of an outer connected accurate dominating set. The outer connected accurate domination number some standard graphs are determined. .Some general properties satisfied by this

concept are studied. Connected graphs of order ???? ≥ 2 with outer connected accurate domination number ???? or ???? − 1 is characterized. It is shown that for every pair of integers

???? and ???? with 2 ≤ ???? ≤ ????, there exists a connected graph ???? such that ???????? (????) = ???? and

???????????????? (????) = ???? where ????????(????) is the accurate domination number of the graph.