Abstract
In a weighted graph, the edges are mainly classified into α, β and δ. In this paper, some sequences in weighted graphs are introduced. These concepts are based on the above classification. Characterisations of partial blocks and partial trees are obtained. It is shown that sequence of a partial tree is the zero sequence, and sequence of a partial block is a binary sequence.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
More From: International Journal of Computing Science and Mathematics
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.