Wiener Polynomials of the Width Distance for Compound Graphs of G1 ☒ G2
For a connected vertex disjoint graphs G<sub>1</sub> and G<sub>2</sub> , we define G1 ☒ G2 as the graph obtained from the union of G<sub>1 </sub>and G<sub>2 </sub>with four edges joining the vertices of an edge of G<sub>1 </sub>to the vert...
Saved in:
| Main Authors: | , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Mosul University
2010-12-01
|
| Series: | Al-Rafidain Journal of Computer Sciences and Mathematics |
| Subjects: | |
| Online Access: | https://csmj.mosuljournals.com/article_163895_f8278704f3e84a0d4111f8df812c1a1c.pdf |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1849727771365867520 |
|---|---|
| author | Ali Ali Asma Aziz |
| author_facet | Ali Ali Asma Aziz |
| author_sort | Ali Ali |
| collection | DOAJ |
| description | For a connected vertex disjoint graphs G<sub>1</sub> and G<sub>2</sub> , we define G1 ☒ G2 as the graph obtained from the union of G<sub>1 </sub>and G<sub>2 </sub>with four edges joining the vertices of an edge of G<sub>1 </sub>to the vertices of an edge of G<sub>2 </sub>.In this paper we obtain Wiener polynomials of the width distance-2 for K<sub>s</sub> ☒ K<sub>t</sub> , K<sub>s</sub> ☒ G<sub>t</sub> and G<sub>s</sub> ☒ G<sub>t</sub>.The Wiener index of each such composite graph is also obtained. |
| format | Article |
| id | doaj-art-b5a2c0c987314c56b019e7f6d4acdce9 |
| institution | DOAJ |
| issn | 1815-4816 2311-7990 |
| language | English |
| publishDate | 2010-12-01 |
| publisher | Mosul University |
| record_format | Article |
| series | Al-Rafidain Journal of Computer Sciences and Mathematics |
| spelling | doaj-art-b5a2c0c987314c56b019e7f6d4acdce92025-08-20T03:09:45ZengMosul UniversityAl-Rafidain Journal of Computer Sciences and Mathematics1815-48162311-79902010-12-0172314610.33899/csmj.2010.163895163895Wiener Polynomials of the Width Distance for Compound Graphs of G1 ☒ G2Ali Ali0Asma Aziz1College of Computer Science and Mathematics University of Mosul, Mosul, IraqCollege of Computer Science and Mathematics University of Mosul, Mosul, IraqFor a connected vertex disjoint graphs G<sub>1</sub> and G<sub>2</sub> , we define G1 ☒ G2 as the graph obtained from the union of G<sub>1 </sub>and G<sub>2 </sub>with four edges joining the vertices of an edge of G<sub>1 </sub>to the vertices of an edge of G<sub>2 </sub>.In this paper we obtain Wiener polynomials of the width distance-2 for K<sub>s</sub> ☒ K<sub>t</sub> , K<sub>s</sub> ☒ G<sub>t</sub> and G<sub>s</sub> ☒ G<sub>t</sub>.The Wiener index of each such composite graph is also obtained.https://csmj.mosuljournals.com/article_163895_f8278704f3e84a0d4111f8df812c1a1c.pdfwiener polynomialswidth distancecompound graphs |
| spellingShingle | Ali Ali Asma Aziz Wiener Polynomials of the Width Distance for Compound Graphs of G1 ☒ G2 Al-Rafidain Journal of Computer Sciences and Mathematics wiener polynomials width distance compound graphs |
| title | Wiener Polynomials of the Width Distance for Compound Graphs of G1 ☒ G2 |
| title_full | Wiener Polynomials of the Width Distance for Compound Graphs of G1 ☒ G2 |
| title_fullStr | Wiener Polynomials of the Width Distance for Compound Graphs of G1 ☒ G2 |
| title_full_unstemmed | Wiener Polynomials of the Width Distance for Compound Graphs of G1 ☒ G2 |
| title_short | Wiener Polynomials of the Width Distance for Compound Graphs of G1 ☒ G2 |
| title_sort | wiener polynomials of the width distance for compound graphs of g1 ☒ g2 |
| topic | wiener polynomials width distance compound graphs |
| url | https://csmj.mosuljournals.com/article_163895_f8278704f3e84a0d4111f8df812c1a1c.pdf |
| work_keys_str_mv | AT aliali wienerpolynomialsofthewidthdistanceforcompoundgraphsofg1g2 AT asmaaziz wienerpolynomialsofthewidthdistanceforcompoundgraphsofg1g2 |