The domination integrity of a connected graph G= (V(G), E(G)) is denoted as DI(G) and defined by DI(G) = min{*S*+ m(G-S) : S is a dominating set } where m(G-S)
This paper is devoted to the study of a translation plane π(C) associated with a t-spread set C and its transposed t-spread set C t. In this paper, an explicit
We investigate prime labeling for some graphs resulted by identifying any two vertices of some graphs. We also introduce the concept of strongly prime graph and