Wiener Polynomials of the Width Distance for Compound Graphs of G1 ☒ G2

For a connected vertex disjoint graphs G1 and G2 , we define G1 ☒ 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 vert...

Full description

Bibliographic Details
Main Authors:	Ali Ali, Asma Aziz
Format:	Article
Language:	Arabic
Published:	Mosul University 2010-12-01
Series:	Al-Rafidain Journal of Computer Sciences and Mathematics
Subjects:	wiener polynomials width distance compound graphs
Online Access:	https://csmj.mosuljournals.com/article_163895_f8278704f3e84a0d4111f8df812c1a1c.pdf

id	doaj-b5a2c0c987314c56b019e7f6d4acdce9
record_format	Article
spelling	doaj-b5a2c0c987314c56b019e7f6d4acdce92020-11-25T04:07:20ZaraMosul UniversityAl-Rafidain Journal of Computer Sciences and Mathematics 1815-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
collection	DOAJ
language	Arabic
format	Article
sources	DOAJ
author	Ali Ali Asma Aziz
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
author_facet	Ali Ali Asma Aziz
author_sort	Ali Ali
title	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_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_sort	wiener polynomials of the width distance for compound graphs of g1 ☒ g2
publisher	Mosul University
series	Al-Rafidain Journal of Computer Sciences and Mathematics
issn	1815-4816 2311-7990
publishDate	2010-12-01
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.
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
_version_	1724429204172308480

Wiener Polynomials of the Width Distance for Compound Graphs of G1 ☒ G2

Similar Items