International Journal of Engineering Research in Electronics and Communication Engineering

On Strong (G, D)-Number of Inflated Graphs

Author : G.SusiVinnarasi ¹ V.Selvalakshmi ² S. Kalavathi ³ K.Palani ⁴

Date of Publication :12th April 2018

Abstract: Strong (G, D)-number of Graphs was introduced by Palani K and SanthaanaGomathi C. Let G be a (V, E) graph. A dominating set is said to be a strong dominating set of G if it strongly dominates all the vertices of its complement. A (G, D)-set D of G is said to be a strong (G, D)-set of G if it strongly dominates all the vertices of V-D. Strong (G, D)-number of Product graphs was discussed by S.Velammal,S.Rajalakshmi and K Palani. Strong (G, D)-number of Middle graphs was discussed by M.Mahalakshmi,A.Sony& K Palani. In this paper, we find the strong (G, D)-number of Inflated Graphs of some standard graphs

Reference :

1. Buckley F, Harary F and Quintas V L, Extremal results on the geodetic number of a graph, Scientia, volume A2 (1988), 17-26
2. Chartrand G, Harary F and Zhang P, Geodetic sets in graphs, DiscussionesMathematicae Graph theory, 20 (2000), 129-138e. [3] Chartrand G, Harary F and Zhang P, On the Geodetic number of a graph, Networks, Volume 39(1) (2002), 1-6.
3. Chartrand G, Zhang P and Harary F, Extremal problems in Geodetic graph Theory, CongressusNumerantium 131 (1998), 55-66.
4. T.W. Haynes, S.T. Hedetniemi and P.J. Slater, Fundamentals Of Domination in graphs, Marcel Decker, Inc., New York 1998.
5. re.O Theory of Graphs, American Mathematical Society Colloquium Publication 38 (American Mathematical Society Providence RI) 1962.
6. Palani .K and Kalavathi. S, (G,D) – Number of some special graphs, International Journal Of Engineering and Mathematical Sciences January-June 2014, Volume 5,Issue1, pp.7-15ISSN(Print) – 2319 – 4537, (Online) – 2319 – 4545.
7. Palani. K and Nagarajan. A (G,D) – number of graphs,International Journal Of Engineering and Mathematics Research. ISSN 0976 – 5840 Volume 3(2011), pp 285 -299.
8. Palani. K ,Nagarajan. A and Mahadevan. G, Results connecting domination, geodetic and (G,D)– number of graph, International Journal Of Combinatorial graph theory and applications, Volume 3, No.1, January – June (2010)(pp.51 -59).
9. SanthaanaGomathi C, Palani K and Kalavathi S, Strong (G,D)-Number of a graph– communicated
10. Mahalakshmi M, Sony A, Palani K and Kalavathi S, Strong (G,D)-Number of Middle graphs -communicated.
11. Velammal S, Rajalakshmi S, Palani K and Kalavathi S, Strong (G,D)-Number of Product graphs-communicated.