Abstract
Let be a simple graph and be an ordered set and. The representation of with respect to is the -tuple . Then is called a monophonic resolving set if different vertices of have different representations with respect to . A monophonic resolving set of minimum number of elements is called a minimum monophonic set for and its cardinality is known as the monophonic metric dimension of , represented by In this article, we determined the monophonic metric dimension of degree splitting graph.
Full Text 
Sign-in/Register to access full text options
Sign-in/Register to access full text options 
Published version (
Free)
Free) 
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 call
