International Journal of Mathematics Trends and Technology
Volume 40 | Number 3 | Year 2016 | Article Id. IJMTT-V40P523 | DOI : https://doi.org/10.14445/22315373/IJMTT-V40P523
In this paper, we introduce the new concept, forcing edge detour domination number and obtain the forcing edge detour domination number for some well known graphs.
[1] F.Buckley and F. Harary, Distance in Graphs Addision-Weseely, Reading MA,1990.
[2] G.Chartrand, H.Escuadro and P.Zhang, Distance in Graphs Taking the Long View, AKCE J.Graphs and Combin.,1,No.1,2004,1-13.
[3] G.Chartrand, L.Johns and P.Zang, Detour Number of graph, utilitas Mathematics, 64 (2003) 97-113.
[4] G.Chartrand and P.Zang, The forcing geodetic number of a graph, Dicuss. Math. Graph Theory,19 (1999), 45 -58.
[5] Haynes T.W, Hedetniemi S.T and Slater P J, Fundamentals of Domination in graphs, Marcel Decker,Inc., New York 1998.
[6] Mahalakshmi.A, Palani.K, Somasundaram.S, Edge Detour Domination Number of Graphs, Proceedings of International Conference on Recent Trends in Mathematical Modelling. ISBN 13-978-93-82592-00-06 (2016), 135-144.
[7] Ore and Berge, Theory of graphs, American Mathematical Society, Colloquim Publications Voume XXXVIII, 1962.
[8] Palani K and Nagarajan A, (G,D)-Number of a graph , International Journal of Mathematics Research.ISSN 0976-5840 Volume 3 Number 3 (2011),285-299.
[9] Palani.K andNagarajan.A, Forcing (G, D)-Number of a graph, International Journal of Mathematical Combinatorics Volume 3 (2011), 82-87.
[10] A.P.Santhakumaran and S.Athisayanathan, Edge detour graphs, Journal of Combinatorial Mathematics and Combinatorial Computing 69 (2009) 191-204.`
Mahalakshmi.A, Palani.K, Somasundaram.S, "Forcing Edge Detour Domination Number of Graphs," International Journal of Mathematics Trends and Technology (IJMTT), vol. 40, no. 3, pp. 191-194, 2016. Crossref, https://doi.org/10.14445/22315373/IJMTT-V40P523
PDF 
Abstract 
Keywords 
References 
Citation