Abstract
Graph theory is a vibrant area in both applications and hypothetical. Graphs can be utilized as a demonstrating device for many problems of realistic consequence. It can be given out as mathematical models to identify a proper graph-theoretic problem. Domination is a hasty sprouting area of research in graph theory, and its various applications are distributed computing and societal networks. Duygu Vargor and Pinar Dundar [1] computed the idea of medium domination number exploited to scrutinize the pair of vertices. This paper study as explored the medium domination number of lexico product of two paths P2 and Pn.
Full Text 
Sign-in/Register to access full text options
Sign-in/Register to access full text options 
Paper version not known
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 callMore From: International Journal of Engineering & Technology
Paper Title
Journal
Date
