Free Access
Issue
RAIRO-Oper. Res.
Volume 53, Number 5, November-December 2019
Page(s) 1721 - 1728
DOI https://doi.org/10.1051/ro/2018074
Published online 09 October 2019
  • K.S. Bagga, L.W. Beineke, W.D. Goddard, M.J. Lipman, R.E. Pippert, A survey of integrity. Discrete Appl. Math. 37/38 (1992) 13–28. [Google Scholar]
  • C.A. Barefoot, R. Entringer, H. Swart, Vulnerability in graphs-a comparative survey. J. Combin. Math. Combin. Comput. 1 (1987) 13–22. [Google Scholar]
  • F. Buckley and F. Harary, Distance in Graphs. Addison-Wesley Publishing Company, Boston, MA (1990). [Google Scholar]
  • P. Dundar and A. Aytac, Integrity of total graphs via certain parameters. Math. Notes 75 (2004) 665–672. [CrossRef] [Google Scholar]
  • W. Goddard and H.C. Swart, Integrity in graphs: bounds and basics. J. Combin. Math. Combin. Comput. 7 (1990) 139–151. [Google Scholar]
  • I. Gutman, Distance in thorny graph. Publ. Inst. Math. (Beograd) 63 (1998) 31–36. [Google Scholar]
  • F. Harary, Graph Theory. Addison Wesley, Boston, MA (1972). [Google Scholar]
  • T. Haynes, S. Hedetniemi and P. Slater, Fundamentals of Domination in Graphs. Marcel Dekker Inc, New York, NY (1998). [Google Scholar]
  • H. Hosoya and F. Harary, On the matching properties of three fence graphs. J. Math. Chem. 12 (1993) 211–218. [Google Scholar]
  • A. Mamut and E. Vumar, A note on the integrity of middle graphs. Lecture Notes in Computer Science. Springer, Berlin 4381 (2007) 130–134. [Google Scholar]
  • T. Shalini and S. Ramesh Kumar, Labeling techniques in friendship graph. Int. J. Eng. Res. Gen. Sci. 3 (2015) 277–284. [Google Scholar]
  • R. Sundareswaran and V. Swaminathan, Domination integrity in graphs. In: Proceedings of International Conference on Mathematical and Experimental Physics, Prague (2010) 46–57. [Google Scholar]
  • R. Sundareswaran, Parameters of vulnerability in graphs. Ph.D. thesis, Rajalakshmi Engineering College, Thandalam, Chennai (2010). [Google Scholar]
  • R. Sundareswaran, V. Swaminathan, Domination integrity of middle graphs, edited by T. Tamizh Chelvam, S. Somasundaram and R. Kala. In: Algebra, Graph Theory and Their Applications, Narosa Publishing House, New Delhi (2010) 88–92. [Google Scholar]
  • R. Sundareswaran and V. Swaminathan, Domination integrity in trees. Bull. Int. Math. Virtual Inst. 2 (2012) 153–161. [Google Scholar]
  • R. Sundareswaran and V. Swaminathan, Computational complexity of domination integrity in graphs. TWMS J. App. Eng. Math. 5 (2015) 214–218. [Google Scholar]
  • S.K. Vaidya and N.J. Kothari, Some new results on domination integrity of graphs. Open J. Discrete Math. 2 (2012) 96–98. [CrossRef] [Google Scholar]
  • S.K. Vaidya and N.J. Kothari, Domination integrity of splitting graph of path and cycle. ISRN Comb. 2013 (2013) 795427. [Google Scholar]
  • S.K. Vaidya and N.H. Shah, Domination integrity of total graphs. TWMS J. App. Eng. Math. 4 (2014) 117–126. [Google Scholar]
  • S.K. Vaidya and N.H. Shah, Domination integrity of some path related graphs. App. Appl. Math. 9 (2014) 780–794. [Google Scholar]
  • D.B. West, Introduction to Graph Theory Second Edition. Prentice Hall, Upper Saddle, NJ (2001). [Google Scholar]

Current usage metrics show cumulative count of Article Views (full-text article views including HTML views, PDF and ePub downloads, according to the available data) and Abstracts Views on Vision4Press platform.

Data correspond to usage on the plateform after 2015. The current usage metrics is available 48-96 hours after online publication and is updated daily on week days.

Initial download of the metrics may take a while.