Wiener Polynomials of the Width Distance for Compound Graphs of G1 ☒ G2
Section: Research Paper
Abstract
For a connected vertex disjoint graphs G1 and G2 , we defineG1 G2 as the graph obtained from the union of G1 and G2 with four edges joining the vertices of an edge of G1 to the vertices of an edge of G2 .In this paper we obtain Wiener polynomials of the width distance-2 forKs Kt , Ks Gtand Gs Gt.The Wiener index of each such composite graph is also obtained.
Identifiers
Download this PDF file
Statistics
How to Cite
A. Ali, A., علی, S. Aziz, A., & أسماء. (2025). Wiener Polynomials of the Width Distance for Compound Graphs of G1 ☒ G2. AL-Rafidain Journal of Computer Sciences and Mathematics, 7(2), 31–46. Retrieved from https://rjps.uomosul.edu.iq/index.php/csmj/article/view/19323