Abstract
If G is any connected graph of order p; then the thorn graph with code (, , , ) is obtained by adding pendent vertices to each vertex of G. By treating the pendent edge of a thorn graph as , , , or , we generalize a thorn graph by replacing by , by , by , by and by and their respective generalized thorn graphs are denoted by , , , and respectively. Many chemical compounds can be treated as , , , and of some graphs in graph theory. In this paper, we obtain the bounds of the wiener index for these generalization of thorn graphs.
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.
