Connectivity, Independency and Colorability of Divisor Function Graph GD(n)
D. Narasimhan1, A. Elamparithi2, R. Vignesh3
1D.Narasimhan, Srinivasa Ramanujan Centre, SASTRA Deemed to be University, Kumbakonam (Tamil Nadu), India.
2A.Elamparithi, Srinivasa Ramanujan Centre, SASTRA Deemed to be University, Kumbakonam (Tamil Nadu), India.
3R.Vignesh, Division of Mathematics, School of Advanced Sciences, VIT, Chennai (Tamil Nadu), India.
Manuscript received on 13 December 2018 | Revised Manuscript received on 22 December 2018 | Manuscript Published on 30 December 2018 | PP: 209-213 | Volume-8 Issue-2S, December 2018 | Retrieval Number: 100.1/ijeat.B10501282S18/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: The aim of the present paper is to find the connectivity of divisor function graph and to determine the colorability of the divisor function graph via Independency of the divisor function graph. Further, the condition for divisor function graph to be isomorphic have been discussed.
Keywords: Function Graph Connectivity Condition.
Scope of the Article: Graph Algorithms and Graph Drawing