References
- Acharya, B. D, Sampathkumar, E. (1987). Graphoidal covers and graphoidal covering number of a graph. Indian J. Pure Appl. Math. 18(10): 882–890.
- Acharya, B. D, Gupta, P. (1999). Domination in graphoidal covers of a graph. Discrete Math. 206(1-3): 3–33.
- Acharya, B. D, Gupta, P. (2007). Further results on domination in graphoidally covered graphs. AKCE Int. J. Graphs. Combin. 4(2): 127–138.
- Arumugam, S, Pakkiam, C. (1994). Graphoidal bipartite graphs. Graphs Combin. 10(2-4): 305–310.
- Arumugam, S, Pakkiam, C. (1994). Graphs with unique minimum graphoidal cover. Indian J. Pure Appl. Math. 25(11): 1147–1153.
- Arumugam, S., Rajasingh, I, Pushpam, P. R. L. (2002). A note on the graphoidal covering number of a graph. J. Discrete Math. Sci. Cryptogr. 5(2): 145–150.
- Arumugam, S, Suseela, J. S. (1998). Acyclic graphoidal covers and path partitions in a graph. Discrete Math. 190(1-3): 67–77.
- Arumugam, S., Acharya, B. D, Sampathkumar, E. (1997). Graphoidal Covers of a Graph: creative Review, Graph Theory and Its Applications. New Delhi: Tata McGraw-Hill, pp. 1–28.
- Arumugam, S., Gupta, P, Singh, R. (2016). Bounds on graphoidal length of a graph. Electronic Notes in Discrete Mathematics 53: 113–122.
- Hamid, I. S, Anitha, A. (2011). On label graphoidal covering number—I. Discrete Math. Algorithm. Appl. 03(01): 1–33.
- Ore, O. (1962). Theory of graphs. Vol. 38, Providence: Amer. Math. Soc. Colloq. Publ.
- Pakkiam, C, Arumugam, S. (1989). On the graphoidal covering number of a graph. Indian J. Pure Appl. Math. 20(4): 330–333.
- Sampathkumar, E. (2000). Semigraphs and their applications, Report on the DST Project.
- West, D. B. (1996). Introduction to Graph Theory. New Jersey: Prentice Hall Inc.