Volume 9 | Number 1 | Year 2014 | Article Id. IJMTT-V9P501 | DOI : https://doi.org/10.14445/22315373/IJMTT-V9P501
Let G = (V,E) be a (p, q) - graph. The longest path P is called a detour distant divisor path if l(P) is a divisor of q . A detour distant divisor graph DD(G) of graph G = (V,E) has the vertex set V = V (G) and two vertices in DD(G) are adjacent if they have the detour distant divisor path in G. In this paper, we deal with the detour distant divisor graph of standard graphs such as path, cycle, star, wheel, complete graph, complete bipartite graph and corona of a complete graph etc.
[1] T.M.Apostol, Introduction to Analytic Number Theory, third edition, Narosa edition, 1991.
[2] R.Aravamudhan and B.Rajendran, Graph Equations involving antipodal graphs, Presented at the Seminar on Combinatorics and applications.ISI, Calcutta, 1984, 40-43.
[3] R.Aravamudhan and B.Rajendran. On antipodal graphs, Discrete Math.49, 1984, 193 - 195.
[4] J.A. Bondy and U.S.R.Murty, Graph theory with Applications, North Holland, 1983 Fifth Printing.
[5] F. Buckley and F. Harary, Distance in graphs, Addison - wesely, Reading, 1990.
[6] David M. Burton, Elementary Number Theory, Tata McGraw-Hill Publishing company Limited, 2006.
[7] F.Harary, Graph Theory, Addison-Wesley Publishing Company, Reading, Mass, 1972.
[8] K.M.Kathiresan and G.Marimuthu, A Study on radial graphs, Ars Combinatoria, 2010, 96, 353-360.
[9] S.Saravanakumar and K.Nagarajan, Distant Divisor Graphs, International Journal of Mathematical Sciences and Engineering Applications, 2013, Vol.7 No.IV, 83-97.
[10] S.Saravanakumar and K.Nagarajan, Distant Divisor Graph of Subdivision of a Graph, International Journal of Mathematics and Soft Computing , Vol.4 No.I 2014, 51-60.
S. SARAVANAKUMAR , K. NAGARAJAN, "Detour Distant Divisor Graphs," International Journal of Mathematics Trends and Technology (IJMTT), vol. 9, no. 1, pp. 1-15, 2014. Crossref, https://doi.org/10.14445/22315373/IJMTT-V9P501