On hinge domination in graphs
Abstract
A set Dh of vertices in a graph G = (V,E) is a hinge dset if every vertex u in V −Dh is adjacent to some vertex v in Dh and a vertex w in V −Dh such that (v,w) is not an edge in E. The hinge domination number γh(G) is the minimum size of a hinged dset. In this paper we determine hinge domination number γh(G) for standard graphs and some shadow distance graphs.
Copyright © 2021 Anjaneyulu Mekala, U. Vijaya Chandra Kumar, R. Murali. 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.
Cite this article
A. Mekala, U. V. C. Kumar, R. Murali, On hinge domination in graphs, J. Math. Comput. Sci. 11 (2021), 5670–5681. https://doi.org/10.28919/jmcs/6089
BibTeX
@article{Mekala2021,
author = {Mekala, Anjaneyulu and Kumar, U. Vijaya Chandra and Murali, R.},
title = {On hinge domination in graphs},
journal = {J. Math. Comput. Sci.},
volume = {11},
year = {2021},
pages = {5670--5681},
doi = {10.28919/jmcs/6089}
}