Table of Contents
ISRN Combinatorics
Volume 2013 (2013), Article ID 795427, 7 pages
http://dx.doi.org/10.1155/2013/795427
Research Article

Domination Integrity of Splitting Graph of Path and Cycle

1Department of Mathematics, Saurashtra University, Rajkot 360005, Gujarat, India
2B. H. Gardi College of Engineering and Technology, P.O. Box 215, Rajkot 360001, Gujarat, India

Received 9 October 2012; Accepted 19 November 2012

Academic Editors: C. da Fonseca, R. Dondi, and R. Sotirov

Copyright © 2013 Samir K. Vaidya and Nirang J. Kothari. 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. C. A. Barefoot, R. Entringer, and H. C. Swart, “Vulnerability in Graphs-a Comparative Survey,” Journal of Combinatorial Mathematics and Combinatorial Computing, vol. 1, pp. 13–22, 1987. View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet
  2. C. A. Barefoot, R. Entringer, and H. C. Swart, “Integrity of trees and powers of cycles,” Congressus Numerantium, vol. 58, pp. 103–114, 1987. View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet
  3. W. Goddard and H. C. Swart, “On the integrity of combinations of graphs,” Journal of Combinatorial Mathematics and Combinatorial Computing, vol. 4, pp. 3–18, 1988. View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet
  4. W. Goddard and H. C. Swart, “Integrity in graphs: bounds and basics,” Journal of Combinatorial Mathematics and Combinatorial Computing, vol. 7, pp. 139–151, 1990. View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet
  5. A. Mamut and E. Vumar, A Note on the Integrity of Middle Graphs, Lecture Notes in Computer Science, vol. 4381, Springer, New York, NY, USA, 2007. View at MathSciNet
  6. P. Dündar and A. Aytaç, “Integrity of total graphs via certain parameters,” Mathematical Notes, vol. 76, no. 5-6, pp. 665–672, 2004. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet · View at Scopus
  7. R. Sundareswaran and V. Swaminathan, “Domination Integrity in graphs,” in Proceedings of International conference on Mathematical and Experimental Physics, pp. 46–57, Narosa Publishing House, 2010.
  8. R. Sundareswaran and V. Swaminathan, “Domination integrity of middle graphs,” in Algebra, Graph Theory and Their Applications, T. T. Chelvam, S. Somasundaram, and R. Kala, Eds., pp. 88–92, Narosa Publishing House, Delhi, India, 2010. View at Google Scholar · View at Zentralblatt MATH
  9. S. Vaidya and N. Kothari, “Some new results on domination integrity of graphs,” Open Journal of Discrete Mathematics, vol. 2, pp. 96–98, 2012. View at Publisher · View at Google Scholar
  10. D. B. West, Introduction To Graph Theory, 2/e, Prentice-Hall, New Delhi, India, 2003. View at MathSciNet
  11. T. Haynes, S. Hedetniemi, and P. Slater, Fundamentals of Domination in Graphs, Marcel Dekker, New York, NY, USA, 1998. View at MathSciNet