Abstract
This article exposes the combinatorial formula that determines the pathdomination number in a grid graph and discusses some of its properties. Seven propertiesare derived regarding the path domination number of grid graphs. Furthermore, some additional properties as direct consequences of the derived main properties are alsodiscussed.
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: Journal of Fundamental Mathematics and Applications (JFMA)
Disclaimer: 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.
