The Connectivity Of Domination Dot-Critical Graphs With No Critical Vertices

Abstract

An edge of a graph is called dot-critical if its contraction decreases the domination number. A graph is said to be dot-critical if all of its edges are dot-critical. A vertex of a graph is called critical if its deletion decreases the domination number.

Keywords

• dot-critical graph
• critical vertex
• connectivity.