Vertex Minimal Dominating Graph

Authors

  • Mr. Yashvanth N   Lecturer, Science Department, Government Polytechnic, Kushalnagar, Karnataka, India

Keywords:

Abstract

In this chapter, we study the vertex minimal dominating graph of a graph G and some of its properties. Also, we present some more basic results on vertex minimal dominating graph, in particular a characterization of which are complete, tree, Eulerian, Hamiltonian and planar. In addition we find the connectedness and diameter of .

References

  1. Berge, C., Graphs and Hyper graphs. North-Holland, Amsterdam,(1973).
  2. F. Harary, Graph Theory. Addision-Wesley, Reading, Mass, (1969).
  3. Haynes, T.W., Hedetniemi, S.T and P.J. Slater, Fundamental of Domination in Graphs. Marcel Dekker, Inc, New York,(1998).
  4. V.R.Kulli and B. Janakiram, The common minimal dominating graph. Indian,J. Pure Appl. Math.,27(1996), 193-196.
  5. V.R. Kulli and B. Janakiram, The minimal dominating graph. Graph Theory Notes of New York, New York Academy of Sciences, 28(1995),12-15.
  6. V.R. Kulli , B. Janakiram, and K.M. Niranjan, The vertex minimal dominating graph Acta Ciencia Indica, 28 (2002), 435-440.

International Journal of Scientific Research in Science and Technology

Downloads

Published

2017-07-30

Issue

Volume 3, Issue 6, July-August-2017

Section

Research Articles

License

Copyright (c) IJSRST

Creative Commons License

This work is licensed under a Creative Commons Attribution 4.0 International License.

How to Cite

[1]
Mr. Yashvanth N "Vertex Minimal Dominating Graph" International Journal of Scientific Research in Science and Technology(IJSRST), Online ISSN : 2395-602X, Print ISSN : 2395-6011,Volume 3, Issue 6, pp.964-969, July-August-2017.