Have a personal or library account? Click to login

Induced label graphoidal graphs

Acta Universitatis Sapientiae, Informatica
Volume 6 (2014): Issue 2 (December 2014)
By:
Open Access
|Jan 2015

References

  1. [1] B. D. Acharya, E. Sampathkumar, Graphoidal covers and graphoidal covering number of a graph, Indian J. Pure Appl. Math., 18, 10 (1987) 882-890. ⇒179, 180
    Search in Google Scholar
  2. [2] S. Arumugam, Path covers in graphs, Lecture Notes of the National Workshop on Decompositions of Graphs and Product Graphs held at Annamalai University, Tamil Nadu, January 3-7, 2006. ⇒179
    Search in Google Scholar
  3. [3] S. Arumugam, B. D. Acharya, E. Sampathkumar, Graphoidal Covers of a Graph: A Creative Review, Proc. National Workshop on Graph Theory and its Applications, Manonmaniam Sundaranar University, Tirunalveli, India, 1996, pp. 1-28. ⇒179
    Search in Google Scholar
  4. [4] S. Arumugam, I. Sahul Hamid, Simple graphoidal covers in graphs, Journal of Combin. Math. Combin. Comput., 64 (2008) 79-95. ⇒179
    Search in Google Scholar
  5. [5] S. Arumugam, I. Sahul Hamid, Label graphoidal covering number of a graph, Proc. Group Discussion on Labeling of Discrete Structures and Applications, Mary Matha Arts College, Mananthawady, Eds. B. D. Acharya, S. Arumugam and A.Rosa, Narosa Publishing House, 2007, pp. 77-82. ⇒180, 185, 187
    Search in Google Scholar
  6. [6] S. Arumugam, J. Suresh Suseela, Acyclic graphoidal covers and path partitions in a graph, Discrete Math., 190, 1-3 (1998), 67-77. ⇒17910.1016/S0012-365X(98)00032-6
    Search in Google Scholar
  7. [7] G. Chartrand, L. Lesniak, Graphs and Digraphs, Fourth Edition, CRC Press, Boca Raton, 2004. ⇒178
    Search in Google Scholar
  8. [8] F. Harary, Covering and packing in graphs I, Ann. N. Y. Acad. Sci., 175 (1970) 198-205. ⇒17910.1111/j.1749-6632.1970.tb45132.x
    Search in Google Scholar
  9. [9] F. Harary, A. J. Schwenk, Evolution of the path number of a graph, covering and packing in graphs II, in: Graph Theory and Computing, Ed. R. C. Rad, Academic Press, New York, 1972, pp. 39-45. ⇒17910.1016/B978-1-4832-3187-7.50009-X
    Search in Google Scholar
  10. [10] K. Ratan Singh, P. K. Das, Induced acyclic graphoidal covers in a graph, World Academy of Science, Engineering and Technology, 68 (2010) 38-44. ⇒179
    Search in Google Scholar
  11. [11] I. Samul Hamid, A. Anitha, On the label graphoidal covering number-I, Trans. on Combinatorics 1, 4 (2012) 25-33. ⇒
    Search in Google Scholar
  12. [12] I. Samul Hamid, A. Anitha, On the Label graphoidal covering number-II, Discrete Math. Algorithms Appl. 3, 1 (2011) 1-7. ⇒10.1142/S179383091100095X
    Search in Google Scholar
  13. [13] I. Samul Hamid, M. Joseph, Further results on induced acyclic graphoidal decomposition, Discrete Math. Algorithms Appl. 5, 1 (2013) 1350006 (11 pages). ⇒17910.1142/S1793830913500067
    Search in Google Scholar
DOI: https://doi.org/10.1515/ausi-2015-0002 | Journal eISSN: 2066-7760
Journal RSS Feed
Language: English
Page range: 178 - 189
Submitted on: Aug 12, 2014
Published on: Jan 27, 2015
Published by: Sapientia Hungarian University of Transylvania
In partnership with: Paradigm Publishing Services
Publication frequency: 2 times per year
Keywords:
induced acyclic graphoidal decomposition,
induced label graphoidal graphs,
induced label graphoidal decomposition number
Related subjects:
Computer sciences,
Computer sciences, other

© 2015 Ismail Sahul Hamid, Mayamma Joseph, published by Sapientia Hungarian University of Transylvania
This work is licensed under the Creative Commons Attribution-NonCommercial-NoDerivatives 3.0 License.

Previous articleVolume 6 (2014): Issue 2 (December 2014)Next article