International Journal Of Computational Engineering Research (<strong>ijcer</strong>online.com) Vol. 2 Issue. 8Case (i) γ nsdsd (G) = n and χ (G) = n-4. Since γ nsdsd (G) = n, G is a star. Therefore n = 6. Then G K 1,5. On increasing thedegree, we get a contradiction.case (ii) γ nsdsd (G) = n-1 and χ (G) = n-3.Since χ (G) = n-3, G contains a clique K on n-3 vertices Let S = {v 1, v 2, v 3 } be the vertices other than the clique K n-3 then = P 3 , K 3 , K 3 , K 2 UK 1Subcase (i) Let < S > = P 3 . Since G is connected, the following are the possible cases (i) there exist a vertex u i of K n-3which is adjacent to any one of end vertices (ii) there exist a vertex u i of K n-3 which is adjacent to other than end vertices.If there exist a vertex u i of K n-3 which is adjacent to any one of end vertices, then γ nsdsd (G) = 5. Hence n = 6. ThereforeK = K 3 . If d(v 1 ) = 2 and d(v 2 ) = d(v 3 ) = 1 then G K 3 (P 4 ). If u i is adjacent to v 2 which is not a pendant vertices then γ nsdsd(G) = 5. Hence n = 6. Therefore K = K 3. If d(v 1 ) = d(v 3 ) = 1 and d(v 2 ) = 3 then G G 1 . If d(v 3 ) = 2 and d(v 1 ) = 1 and d(v 2 )= 3 then G G 2 . If d(v 1 ) = 1 and d(v 2 ) = 3 and d(v 3 ) = 2 then G G 3.Subcase (ii) Let < S > = K 3 . Since G is connected, there exist a vertex u i of K n-3 adjacent to anyone of {v 1, v 2 , v 3 }.Without loss of generality let v 1 be adjacent to u i, then γ nsdsd (G) = 5. Therefore K=K 3. If d(v 1 ) =3 and d(v 2 ) = d(v 3 ) = 2 thenG G 4. If d(v 1 ) = 3 and d(v 2 ) = 3 and d(v 3 ) = 2 then G G 5. On increasing the degree we get a contradiction.Subcase (iii) Let < S > = K 3 . Since G is connected, let all the vertices of K 3 be adjacent to vertex u i . Then γ nsdsd (G) = 5.Hence n = 6. Therefore K = K 3. Let u 1, u 2, u 3 be the vertices of K 3. Let all the three vertices of K 3 adjacent to u 1. ThenG K 3 (3 ). If d(v 3 ) = 2 and d(v 1 ) = 1 and d(v 2 ) = 1 then G G 6 .On increasing the degree, we get a contradiction. If twovertices of K 3 are adjacent to u i and the third vertex adjacent to u j for some i≠j, then γ nsdsd (G) = 5. Hence n = 6. Therefore K= K 3. Let u 1, u 2, u 3 be the vertices of K 3. Then G K 3 (2, 1 , 0). If d(v ) = 1 and d(v 2 ) = 2 and d(v 3 ) = 1 then G G 7 . Onincreasing the degree, we get a contradiction . If all the three vertices of K 3 are adjacent to three distinct vertices of K n-3 sayu i, u j, u k for i ≠ j ≠ k, then γ nsdsd (G) = 5. Hence n = 6. Therefore K = K 3. Let u 1, u 2, u 3 be the vertices of K 3. Then G K 3(1,1,1) . On increasing the degree, we get a contradiction.Subcase (iv) Let < S > = K 2 K 1 . Since G is connected, there exist a vertex u i of K n-3 which is adjacent to anyone of {v 1 ,v 2 } and v 3 . Then γ nsdsd (G) = 4. Hence n = 6. Therefore K = K 2, so that G S(K 1,3 ). On increasing the degree, we get acontradiction. Let there exist a vertex u i of K n-3 be adjacent to any one of {v 1 , v 2 } and u j for some I ≠ j in K n-3 adjacent to v 3 .Hence γ nsdsd (G) = 4, so that n = 5. Therefore K = K 2, which is a contradiction.If G does not contain a clique K on n-3 vertices, then it can be verified that no new graph exist.Case (iii) γ nsdsd (G) = n-2 and χ (G) = n-2. Since χ (G) = n-2, G contains a clique K on n-2 vertices. Let S = { v 1, v 2, v 3, v 4 }be the vertices other than the clique K n-2 then the possible cases are = K 2 , K 2 .Subcase (i) Let = K 2. Since G is connected, either v 1 or v 2 is adjacent to u i for some i in K n-2 . Then γ nsdsd (G) = 4 sothat n = 6. Therefore K= K 4. Let u 1, u 2, u 3 be the vertices of K 3 . Therefore G K 4 (P 3 ). On increasing the degree, thenG G 8, G 9.Subcase (ii) Let = K 2 . Since G is connected, both v 1 and v 2 adjacent to u i for some i in K n-2. Then γ nsdsd (G) = 4 so thatn = 6.Therefore K= K 4. Let u 1, u 2, u 3 , u 4 be the vertices of K 4 . Therefore G K 4 (2). If d(v 1 ) = 1 and d(v 2 ) = 2 then G G 10.On increasing the degree, we get a contradiction. . If the two vertices are adjacent to two distinct vertices of K n-2, thenγ nsdsd (G) = 4. Hence n = 6.Theefore K = K 4. Then G K 4 (P 2, P 2, 0, 0). If d(v 1 ) = 2 and d(v 2 ) = 1 then G G 11. If d(v 1 ) = 2and d(v 2 ) = 2 then G G 12. On increasing the degree, we get a contradiction. .Case (iv) γ nsdsd (G) = n-3 and χ(G) = n-1.Since χ(G) = n-1, G contains a clique K on n-1 vertices. Let the vertex v 1 isadjacent to u i for some i in K n-1. Therefore γ nsdsd (G) = 3, hence n = 6. Therefore K = K 5 . Then G K 5 (P 2 ). If d (v) = 2 thenG G 15. On increasing the degree, we get a contradiction.Case (v) Let γ nsdsd (G) = n-4 and χ (G) = n. Since χ (G) = n, G K n . But for K n , γ nsdsd (G) = 2, so that n = 6. ThereforeG K 6.References[1]. Acharya.B.D, and Walikar.H.B,(1979): On Graphs having unique minimum dominating sets, Graph theory newsletter, 8.2.[2]. Acharya.B.D, (1980): The strong domination number of a graph and related concepts, J.Math.Phys.Sci,14 pp 471-475.[3]. Harary F(1972): Graph theory , Addison Wesley Reading Mass.[4]. John Clark and Derek Allan Holton (1995): A First Look at Graph Theory, Allied Publisher Ltd .[5]. Kulli.V.R and Janakiram. B (2000): The nonsplit domination number of a graph, Indian J. Pure and Appl. Math.,31(4) pp 441-447.Issn <strong>2250</strong>-<strong>3005</strong>(online) December| 2012 Page 45
International Journal Of Computational Engineering Research (<strong>ijcer</strong>online.com) Vol. 2 Issue. 8[6]. Mahadevan G. (2005): On Domination Theory and related topics in graphs, Ph. D, Thesis, ManonmaniamSundaranar University, Tirunelveli.[7]. Mahadevan G, Selvam A, Hajmeeral M (2009): On efficient domination number and chromatic number of a graph I, International Journal of Physical Sciences, vol 21(1)M, pp1-8.[8]. Mahadevan G, Selvam Avadayappan. A and Hajmeeral M(2010): “Further results on dom strong dominationnumber of the graph”, International Journal of Algorithms, Computing and Mathematics, vol 3,no 1 , pp 23-30.[9]. Mahadevan G, Selvam Avadayappan. A and Hajmeeral.M and Latha Venkateswari.U, (2010): “Furthercharacterization of connected efficient domination number of a graph”, International Journal of CombinatorialGraph theory and applications, Vol 3, no 1, Jan-Jun 2010, pp 29-39.[10]. Namasivayam. P (2008): Studies in strong double domination in graphs, Ph.D., thesis, Manonmaniam SundaranarUniversity, Tirunelveli, India.[11]. Paulraj Joseph J and Arumugam S (1992): Domination and connectivity in graphs, International Journal ofmanagement and systems,vol 15 No.1, 37-44.[12]. Paulraj Joseph J. and Arumugam S. (1997): Domination and colouring in graphs, International Journal ofManagement and Systems, Vol.8 No.1, 37-44.[13]. Paulraj Joseph J. and Mahadeven G. (2002): Complementary connected domination number and chromatic numberof a graph Mathematical and Computational models, Allied Publications, India.342-349.[14]. Paulraj Joseph J. and Mahadevan G and Selvam A (2006): On Complementary perfect domination number of agraph, Acta Ciencia Indica Vol. XXXI M, No.2, 847, ( An International Journal of Physical Sciences ).[15]. Sampathkumar E and Puspalatha.L (1996): Strong weak domination and domination balance in a graph, Discretemath. 161, pp 235-242.[16]. Swaminathan.V, et.al, (2005): Dom-strong domination and dsd-domatic number of a graph, Proceedings of thenational conference on “The emerging trends in Pure and Applied Mathematics”, St.Xavier’s College,Palayamkottai, pp 150-153.[17]. Tersa W.Haynes, Stephen T.Hedetniemi and Peter J.Slater(1998): Fundamentals of domination in graphs, MarcelDekker, Reading mass.[18]. Teresa W. Hayens (2001): Induced Paired domination in graphs, Arts Combin.57, 111-128.[19]. Tersa W.Haynes, Stephen T.Hedetniemi and Peter J.Slater(1998): Domination in graphs,Advanced Topics, MarcelDekker, Reading mass.Issn <strong>2250</strong>-<strong>3005</strong>(online) December| 2012 Page 46
- Page 1 and 2: ISSN: 2250-3005VOLUME 2 December 20
- Page 3 and 4: Meisam MahdaviQualification: Phd El
- Page 5 and 6: 16. Implementation Of Serial Commun
- Page 7 and 8: 45 Performance Evaluation Of Energy
- Page 9 and 10: International Journal Of Computatio
- Page 11 and 12: International Journal Of Computatio
- Page 13 and 14: International Journal Of Computatio
- Page 15 and 16: International Journal Of Computatio
- Page 17 and 18: International Journal Of Computatio
- Page 19 and 20: International Journal Of Computatio
- Page 21 and 22: 01 .048International Journal Of Com
- Page 23 and 24: International Journal Of Computatio
- Page 25 and 26: International Journal Of Computatio
- Page 27 and 28: International Journal Of Computatio
- Page 29 and 30: International Journal Of Computatio
- Page 31 and 32: International Journal Of Computatio
- Page 33 and 34: International Journal Of Computatio
- Page 35 and 36: International Journal Of Computatio
- Page 37 and 38: International Journal Of Computatio
- Page 39 and 40: International Journal Of Computatio
- Page 41 and 42: International Journal Of Computatio
- Page 43 and 44: International Journal Of Computatio
- Page 45 and 46: International Journal Of Computatio
- Page 48 and 49: International Journal Of Computatio
- Page 50 and 51: International Journal Of Computatio
- Page 54 and 55: International Journal Of Computatio
- Page 56 and 57: International Journal Of Computatio
- Page 58 and 59: International Journal Of Computatio
- Page 60 and 61: International Journal Of Computatio
- Page 62 and 63: International Journal Of Computatio
- Page 64 and 65: International Journal Of Computatio
- Page 66 and 67: International Journal Of Computatio
- Page 68 and 69: International Journal Of Computatio
- Page 70 and 71: International Journal Of Computatio
- Page 72 and 73: International Journal Of Computatio
- Page 74 and 75: International Journal Of Computatio
- Page 76 and 77: International Journal Of Computatio
- Page 78 and 79: International Journal Of Computatio
- Page 80 and 81: International Journal Of Computatio
- Page 82 and 83: International Journal Of Computatio
- Page 84 and 85: International Journal Of Computatio
- Page 86 and 87: International Journal Of Computatio
- Page 88 and 89: International Journal Of Computatio
- Page 90 and 91: International Journal Of Computatio
- Page 92 and 93: International Journal Of Computatio
- Page 94 and 95: International Journal Of Computatio
- Page 96 and 97: International Journal Of Computatio
- Page 98 and 99: International Journal Of Computatio
- Page 100 and 101: International Journal Of Computatio
- Page 102 and 103:
International Journal Of Computatio
- Page 104 and 105:
International Journal Of Computatio
- Page 106 and 107:
International Journal Of Computatio
- Page 108 and 109:
INTERNATIONAL JOURNAL OF COMPUTATIO
- Page 110 and 111:
INTERNATIONAL JOURNAL OF COMPUTATIO
- Page 112 and 113:
INTERNATIONAL JOURNAL OF COMPUTATIO
- Page 114 and 115:
International Journal Of Computatio
- Page 116 and 117:
International Journal Of Computatio
- Page 118 and 119:
International Journal Of Computatio
- Page 120 and 121:
International Journal Of Computatio
- Page 122 and 123:
International Journal Of Computatio
- Page 124 and 125:
International Journal Of Computatio
- Page 126 and 127:
International Journal Of Computatio
- Page 128 and 129:
International Journal Of Computatio
- Page 130 and 131:
International Journal Of Computatio
- Page 132 and 133:
International Journal Of Computatio
- Page 134 and 135:
International Journal Of Computatio
- Page 136 and 137:
International Journal Of Computatio
- Page 138 and 139:
International Journal Of Computatio
- Page 140 and 141:
International Journal Of Computatio
- Page 142 and 143:
International Journal Of Computatio
- Page 144 and 145:
International Journal Of Computatio
- Page 146 and 147:
International Journal Of Computatio
- Page 148 and 149:
International Journal Of Computatio
- Page 150 and 151:
International Journal Of Computatio
- Page 152 and 153:
International Journal Of Computatio
- Page 154 and 155:
International Journal Of Computatio
- Page 156 and 157:
International Journal Of Computatio
- Page 158 and 159:
International Journal Of Computatio
- Page 160 and 161:
International Journal Of Computatio
- Page 162 and 163:
International Journal Of Computatio
- Page 164 and 165:
International Journal Of Computatio
- Page 166 and 167:
International Journal Of Computatio
- Page 168 and 169:
International Journal Of Computatio
- Page 170 and 171:
International Journal Of Computatio
- Page 172 and 173:
International Journal Of Computatio
- Page 174 and 175:
International Journal Of Computatio
- Page 176 and 177:
International Journal Of Computatio
- Page 178 and 179:
International Journal Of Computatio
- Page 180 and 181:
International Journal Of Computatio
- Page 182 and 183:
International Journal Of Computatio
- Page 184 and 185:
International Journal Of Computatio
- Page 186 and 187:
Body Acceleration (m/Sec2)Dynamic T
- Page 188 and 189:
International Journal Of Computatio
- Page 190 and 191:
International Journal Of Computatio
- Page 192 and 193:
International Journal Of Computatio
- Page 194 and 195:
International Journal Of Computatio
- Page 196 and 197:
International Journal Of Computatio
- Page 198 and 199:
International Journal Of Computatio
- Page 200 and 201:
International Journal Of Computatio
- Page 202 and 203:
International Journal Of Computatio
- Page 204 and 205:
International Journal Of Computatio
- Page 206 and 207:
International Journal Of Computatio
- Page 208 and 209:
International Journal Of Computatio
- Page 210 and 211:
International Journal Of Computatio
- Page 212 and 213:
International Journal Of Computatio
- Page 214 and 215:
International Journal Of Computatio
- Page 216 and 217:
International Journal Of Computatio
- Page 218 and 219:
International Journal Of Computatio
- Page 220 and 221:
International Journal Of Computatio
- Page 222 and 223:
International Journal Of Computatio
- Page 224 and 225:
EigenvalueEigenvalueInternational J
- Page 226 and 227:
International Journal Of Computatio
- Page 228 and 229:
International Journal Of Computatio
- Page 230 and 231:
International Journal Of Computatio
- Page 232 and 233:
International Journal Of Computatio
- Page 234 and 235:
International Journal Of Computatio
- Page 236 and 237:
International Journal Of Computatio
- Page 238 and 239:
International Journal Of Computatio
- Page 240 and 241:
International Journal Of Computatio
- Page 242 and 243:
International Journal Of Computatio
- Page 244 and 245:
International Journal Of Computatio
- Page 246 and 247:
International Journal Of Computatio
- Page 248 and 249:
International Journal Of Computatio
- Page 250 and 251:
International Journal Of Computatio
- Page 252 and 253:
International Journal Of Computatio
- Page 254 and 255:
International Journal Of Computatio
- Page 256 and 257:
International Journal Of Computatio
- Page 258 and 259:
International Journal Of Computatio
- Page 260 and 261:
International Journal Of Computatio
- Page 262 and 263:
International Journal Of Computatio
- Page 264 and 265:
International Journal Of Computatio
- Page 266 and 267:
International Journal Of Computatio
- Page 268 and 269:
International Journal Of Computatio
- Page 270 and 271:
International Journal Of Computatio
- Page 272 and 273:
International Journal Of Computatio
- Page 274 and 275:
International Journal Of Computatio
- Page 276 and 277:
International Journal Of Computatio
- Page 278 and 279:
International Journal Of Computatio
- Page 280 and 281:
International Journal Of Computatio
- Page 282 and 283:
International Journal Of Computatio
- Page 284 and 285:
International Journal Of Computatio
- Page 286 and 287:
International Journal Of Computatio
- Page 288 and 289:
International Journal Of Computatio
- Page 290 and 291:
International Journal Of Computatio
- Page 292 and 293:
International Journal Of Computatio
- Page 294 and 295:
International Journal Of Computatio
- Page 296 and 297:
International Journal Of Computatio
- Page 298 and 299:
International Journal Of Computatio
- Page 300 and 301:
International Journal Of Computatio
- Page 302 and 303:
International Journal Of Computatio
- Page 304 and 305:
International Journal Of Computatio
- Page 306 and 307:
International Journal Of Computatio
- Page 308 and 309:
International Journal Of Computatio
- Page 310 and 311:
International Journal Of Computatio
- Page 312 and 313:
International Journal Of Computatio
- Page 314 and 315:
International Journal Of Computatio
- Page 316 and 317:
International Journal Of Computatio
- Page 318 and 319:
International Journal Of Computatio
- Page 320 and 321:
International Journal Of Computatio
- Page 322 and 323:
International Journal Of Computatio
- Page 324 and 325:
International Journal Of Computatio
- Page 326 and 327:
International Journal Of Computatio
- Page 328 and 329:
International Journal Of Computatio
- Page 330 and 331:
International Journal Of Computatio
- Page 332 and 333:
International Journal Of Computatio
- Page 334 and 335:
Average JitterThroughputInternation
- Page 336 and 337:
Energy Consumed in Received ModeEne
- Page 338 and 339:
International Journal Of Computatio
- Page 340 and 341:
International Journal Of Computatio
- Page 342 and 343:
International Journal Of Computatio
- Page 344 and 345:
International Journal Of Computatio