Abstract
We presented a formula for the Wiener polynomial of thekthpower graph. We use this formula to find the Wiener polynomials of thekthpower graphs of paths, cycles, ladder graphs, and hypercubes. Also, we compute the Wiener indices of these graphs.
Highlights
The graphs in this paper are connected and simple
We presented a formula for the Wiener polynomial of the kth power graph
The Wiener polynomial and the Wiener index of G are defined as follows
Summary
The graphs in this paper are connected and simple. Let d(u,v) denote the distance between two vertices u,v ∈ V (G). We presented a formula for the Wiener polynomial of the kth power graph. We use this formula to find the Wiener polynomials of the kth power graphs of paths, cycles, ladder graphs, and hypercubes. The Wiener polynomial and the Wiener index of G are defined as follows. Many papers have been devoted to compute the Wiener polynomial for different types of graphs.
Sign-in/Register to view highlights & summary 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 callMore From: International Journal of Mathematics and Mathematical Sciences
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.
