Contents

-

On Unique Realizations of Domination Chain Parameters

Jason Hedetniemi1, Kevin James1
1Department of Mathematical Sciences Clemson University Clemson, South Carolina 29634 U.S.A.

Abstract

The domination chain ιr(G)γ(G)ι(G)βo(G)Γ(G)IR(G), which holds for any graph G, is the subject of much research. In this paper, we consider the maximum number of edges in a graph having one of these domination chain parameters equal to 2 through a unique realization. We show that a specialization of the domination chain still holds in this setting.

Keywords: vertex domination, vertex independence, vertex irredundance 2010 Mathematics Subject Classification: 05C6