Abstract
An isometric path partition of a graph G is defined as a set of isometric paths that partition the vertex set of G. The problem of isometric path partition is to obtain a minimum isometric path partition of G. The isometric path partition number of a graph G, denoted by ip p (G) is the minimum cardinality of isometric path partition in G. In this paper, we compute the isometric path partition number of certain tree derived architectures like hypertrees, 1-rooted sibling trees, k-rooted sibling trees, l-complete binary trees, and l-sibling trees.
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.
