Author : A.Niranjana 1
Date of Publication :20th April 2018
Abstract: (G,D)-number of graphs was introduced by Palani K and Nagarajan A. Let G be a (V,E) graph. A dominating set is a subset D of V such that every vertex in V-D is adjacent to atleast one vertex of D. A (G,D)-set D of G is a subset D of V(G) which is both a dominating and a geodetic set of G.In this paper, we find the (G,D)-number of weak(or kronecker) product and strong product (or composition)of some standard graphs
Reference :
-
- A note on the connectivity of Kronecker products of graphs-http://www.science direct.com>pii.
- Buckley F, Harary F and Quintas V L, Extremal results on the geodetic number of a graph, Scientia, volume A2 (1988), 17-26.
- Chartrand G, Harary F and Zhang P, Geodetic sets in graphs, Discussiones Mathematicae Graph theory, 20 (2000), 129-138e.
- Chartrand G, Harary F and Zhang P, On the Geodetic number of a graph, Networks, Volume 39(1) (2002), 1-6.
- Chartrand G, Zhang P and Harary F, Extremal problems in Geodetic graph Theory, Congressus Numerantium 131 (1998), 55-66.
- T.W. Haynes, S.T. Hedetniemi and P.J. Slater, Fundamentals Of Domination in graphs, Marcel Decker, Inc., New York 1998
- re.O Theory of Graphs, American Mathematical Society Colloquium Publication 38 (American Mathematical Society Providence RI) 1962
- 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.
- 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.
- 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).