Connected cototal domination number of a graph.docVIP

Transactions on Combinatorics ISSN(print): 2251-8657,ISSN(on-line): 2251-8665 Vol. 01No. 2(2012),pp. 17-25. c 2012UniversityofIsfahan binatorics.ir www.ui.ac.ir CONNECTED COTOTAL DOMINATION NUMBER OF A GRAPH ? B.BASAVANAGOUD ANDS.M.HOSAMANI CommunicatedbyAlirezaAbdollahi Abstract. AdominatingsetD?V ofagraphG=(V,E)issaidtobeaconnectedcototaldominating setifhDiisconnectedandhV?Di=?,containsnoisolatedvertices. Aconnectedcototaldominating setissaidtobe minimalifnopropersubsetofD isconnectedcototaldominatingset. Theconnected cototal domination number γccl(G) of G is the minimum cardinality of a minimal connected cototal dominatingsetofG. Inthispaper,webeginaninvestigationofconnectedcototaldominationnumber andobtainsomeinterestingresults. 1. Introduction Allgraphsconsideredherearesimple, ?nite, connectedandnontrivial. LetG=(V(G),E(G))be a graph, where V(G) is the vertex set and E(G) be the edge set of G. The vertex v ∈V is called a pendantvertex,ifdeg (v)=1andanisolatedvertex ifdeg (v)=0,wheredeg (x)isthedegreeofa G G G vertex x∈V(G). Avertexwhichisadjacenttoapendantvertexiscalledasupportvertex. Wedenote δ(G)(?(G))astheminimum(maximum) degree andp=|V(G)|,q=|E(G)|theorder andsize ofG respectively. AspanningsubgraphisasubgraphcontainingalltheverticesofG. Ashortestu?vpath isoftencalledageodesic. Thediameter diam(G)ofaconnectedgraphGisthelengthofanylongest geodesic. The neighborhood of a vertex u in V is the set N(u) consisting of all vertices v which are adjacentwithu. Theclosedneighborhood isN[u]=N(u)∪{u}. Thecorona oftwographsGandH is the graph G?H formed from one copy of G and |V(G)| copies of H where ith vertex of G is ad- jacenttoeveryvertexintheithcopyofH. Anyunde?nedterminthispapermaybefoundin[5]or[6]. MSC(2010): Primary: 05C69. Keywords: domination number, connected domination number, cototal domination number and connected cototal domination number. Received: 26March2012,Accepted: 11May2012. ?Correspondin