Abstract
The G be a connected graph with vertex set V(G) and edge set E(G). A subset S⊆V(G) is called a dominating set of G if for every vertex x in V(G)∖S, there exists at least one vertex u in S such that x is adjacent to u. An ordered set W⊆V(G) is called a resolving set of G, if every pair of vertices u and v in V(G) have distinct representation with respect to W. An ordered set S⊆V(G) is called a dominant resolving set of G, if S is a resolving set and also a dominating set of G. The minimum cardinality of dominant resolving set is called a dominant metric dimension of G, denoted by Ddim(G). In this paper, we investigate the dominant metric dimension of some particular class of graphs, the characterisation of graph with certain dominant metric dimension, and the dominant metric dimension of joint and comb products of graphs.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
