Abstract
A decomposition of a graph is a collection of its edge — disjoint subgraphs whose union equals the edge set of the graph. A decomposition all of whose members are paths is called a path decomposition. In this paper, we introduce and initiate a study of a new variation of decomposition namely equitable path decomposition of a graph [Formula: see text] which is defined to be a decomposition in which all the members are paths and the lengths of any two paths are differ by at most one in [Formula: see text]. In this paper, we initiate a study on this parameter.
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.
