Directed Divisor Function Graph GDij(n)
D. Narasimhan1, R. Vignesh2, A. Elamparithi3
1D.Narasimhan, Srinivasa Ramanujan Centre, SASTRA Deemed to be University, Kumbakonam (Tamil Nadu), India.
2R.Vignesh, Division of Mathematics, School of Advanced Sciences, VIT, Chennai (Tamil Nadu), India.
3A.Elamparithi, Srinivasa Ramanujan Centre, SASTRA Deemed to be University, Kumbakonam (Tamil Nadu), India.
Manuscript received on 13 December 2018 | Revised Manuscript received on 22 December 2018 | Manuscript Published on 30 December 2018 | PP: 214-218 | Volume-8 Issue-2S, December 2018 | Retrieval Number: 100.1/ijeat.B10511282S18/18©BEIESP
Open Access | Editorial and Publishing Policies | Cite | Mendeley | Indexing and Abstracting
© The Authors. Blue Eyes Intelligence Engineering and Sciences Publication (BEIESP). This is an open access article under the CC-BY-NC-ND license (http://creativecommons.org/licenses/by-nc-nd/4.0/)
Abstract: A newer class of graph namely directed divisor function graph is defined and analyzed. Further, directed divisor function sub-digraph, complete directed divisor function graph and characteristics like tournament, Eulerian, Hamiltonian have been discussed.
Keywords: Function Graph Characteristics Directed.
Scope of the Article: Graph Algorithms and Graph Drawing