Hinge Bidomination of a Graph

Abstract

Domination in graphs is a fundamental concept in graph theory with numerous applications across various fields. The introduction of many variants of domination stems from the diverse applications and the need to address different real-world problems more effectively. In this paper, we introduce a new variant of domination namely hinge bidomination in graphs. We find the hinge bidomination values of certain graphs and few results about the existence of hinge bidomination in graphs.