Table of Contents
ISRN Discrete Mathematics
Volume 2014, Article ID 975812, 5 pages
http://dx.doi.org/10.1155/2014/975812
Research Article

Edge Domination in Some Path and Cycle Related Graphs

1Department of Mathematics, Saurashtra University, Rajkot, Gujarat 360005, India
2Department of Mathematics, A.V. Parekh Technical Institute, Rajkot, Gujarat 360001, India

Received 6 December 2013; Accepted 23 January 2014; Published 13 March 2014

Academic Editors: T. Došlić, H.-J. Kreowski, and U. Vaccaro

Copyright © 2014 S. K. Vaidya and R. M. Pandit. This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.

Linked References

  1. S. T. Hedetniemi and R. C. Laskar, “Bibliography on domination in graphs and some basic definitions of domination parameters,” Discrete Mathematics, vol. 86, no. 1–3, pp. 257–277, 1990. View at Publisher · View at Google Scholar · View at MathSciNet
  2. S. Mitchell and S. T. Hedetniemi, “Edge domination in trees,” Congressus Numerantium, vol. 19, pp. 489–509, 1977. View at Google Scholar
  3. S. Arumugam and S. Velammal, “Edge domination in graphs,” Taiwanese Journal of Mathematics, vol. 2, no. 2, pp. 173–179, 1998. View at Google Scholar · View at MathSciNet
  4. S. Arumugam and S. Jerry, “Fractional edge domination in graphs,” Applicable Analysis and Discrete Mathematics, vol. 3, no. 2, pp. 359–370, 2009. View at Publisher · View at Google Scholar · View at MathSciNet
  5. V. R. Kulli and N. D. Soner, “Complementary edge domination in graphs,” Indian Journal of Pure and Applied Mathematics, vol. 28, no. 7, pp. 917–920, 1997. View at Google Scholar · View at MathSciNet
  6. S. R. Jayaram, “Line domination in graphs,” Graphs and Combinatorics, vol. 3, no. 4, pp. 357–363, 1987. View at Publisher · View at Google Scholar · View at MathSciNet
  7. R. Dutton and W. F. Klostermeyer, “Edge dominating sets and vertex covers,” Discussiones Mathematicae, vol. 33, no. 2, pp. 437–456, 2013. View at Publisher · View at Google Scholar · View at MathSciNet
  8. M. Yannakakis and F. Gavril, “Edge dominating sets in graphs,” SIAM Journal on Applied Mathematics, vol. 38, no. 3, pp. 364–372, 1980. View at Publisher · View at Google Scholar · View at MathSciNet
  9. D. A. Mojdeh and R. Sadeghi, “Independent edge dominating set of certain graphs,” International Mathematical Forum, vol. 2, no. 7, pp. 315–320, 2007. View at Google Scholar · View at MathSciNet
  10. M. H. Muddebihal and A. R. Sedamkar, “Characterization of trees with equal edge domination and end edge domination numbers,” International Journal of Mathematics and Computer Applications Research, vol. 3, no. 1, pp. 33–42, 2013. View at Google Scholar
  11. B. Zelinka, “Edge domination in graphs of cubes,” Czechoslovak Mathematical Journal, vol. 52, no. 4, pp. 875–879, 2002. View at Publisher · View at Google Scholar · View at MathSciNet
  12. D. B. West, Introduction to Graph Theory, Prentice Hall, New Delhi, India, 2003. View at MathSciNet
  13. J. A. Gallian, “A dynamic survey of graph labeling,” The Electronic Journal of Combinatorics, vol. 16, article #DS6, 2013, http://www.combinatorics.org/. View at Google Scholar
  14. M. Behzad, “A criterion for the planarity of the total graph of a graph,” Proceedings of the Cambridge Philosophical Society, vol. 63, pp. 679–681, 1967. View at Google Scholar · View at MathSciNet
  15. T. W. Haynes, S. T. Hedetniemi, and P. J. Slater, Fundamentals of Domination in Graphs, vol. 208 of Monographs and Textbooks in Pure and Applied Mathematics, Marcel Dekker, New York, NY, USA, 1998. View at MathSciNet