Ghaph Valued Functions
DOI:
https://doi.org/10.32628/IJSRSET214414Keywords:
Minimal Dominating Graph, Domatic Number, Graph Valued FunctionsAbstract
In this paper, we obtain some basic results on minimal dominating graph, in particular a characterization of MD(G) which are complete, eulerian, hamiltonian and connectedness. In addition, we find the relationship of MD(G) with other graph valued functions.
References
- E. J. Cockayne and S. T. Hedetniemi, Towards a theory of domination in graphs. Networks, 7(1977), 247-261.
- B.J. Cockayne and S.T. Hedetniemi, Independence graphs. In proc.5th S-
- E. Conf. combinatorics, Graph Theory and computing, (1974), 471-491.
- Gary Chartrand and Ping Zhang, Introduction to Graph Theory. Tata McGraw-Hill Edition, (2006).
- Jangid, J. (2020). Efficient Training Data Caching for Deep Learning in Edge Computing Networks. International Journal of Scientific Research in Computer Science, Engineering and Information Technology, 7(5), 337–362. https://doi.org/10.32628/CSEIT20631113
- F. Harary, Graph Theory. Addison-Wesley, Reading, Mass, (1969).
- T.W. Haynes, S.T.Hedetniemi and P.J.Slater, Fundamentals of Domination in Graphs. Marcel Dekkar. Inc. New York, (1998).
Downloads
Published
2021-12-30
Issue
Section
Research Articles
License
Copyright (c) IJSRSET

This work is licensed under a Creative Commons Attribution 4.0 International License.
How to Cite
[1]
Mr. Somashekhar Maranoor, Mr. Umesh
"Ghaph Valued Functions" International Journal of Scientific Research in Science, Engineering and Technology (IJSRSET), Print ISSN : 2395-1990, Online ISSN : 2394-4099,
Volume 8, Issue 6, pp.305-310, November-December-2021. Available at doi : https://doi.org/10.32628/IJSRSET214414