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!
|
| Summary: | 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. |
|---|---|
| ISSN: | 1815-4816 2311-7990 |