Weiner Polynomials for Generalization of Distance for Some Special Graphs
The minimum distance of a vertex v to an set of vertices of a graph G is defined as :<br /> .<br /> The n-Wiener polynomial for this distance of a graph G is defined as<br /> ,<br /> where is the number of order pairs (v,S), , such that<br /> ,<br...
Saved in:
| Main Authors: | , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Mosul University
2006-12-01
|
| Series: | Al-Rafidain Journal of Computer Sciences and Mathematics |
| Subjects: | |
| Online Access: | https://csmj.mosuljournals.com/article_164061_5e74c038280d8a110cd193d01570d5ac.pdf |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1850274992345841664 |
|---|---|
| author | Ali Ali Ahmed Ali |
| author_facet | Ali Ali Ahmed Ali |
| author_sort | Ali Ali |
| collection | DOAJ |
| description | The minimum distance of a vertex v to an set of vertices of a graph G is defined as :<br /> .<br /> The n-Wiener polynomial for this distance of a graph G is defined as<br /> ,<br /> where is the number of order pairs (v,S), , such that<br /> ,<br /> and is the diameter for this minimum n-distance.<br /> In this paper, the n-Wiener polynomials for some types of graphs such as complete graphs, bipartite graphs, star graphs, wheel graphs, path and cycle graphs are obtained .The n-Wiener index for each of these special graphs is given. Moreover, some properties of the coefficients of are established.<br /> |
| format | Article |
| id | doaj-art-fbcdcfa05041487dad81d6c7d4129394 |
| institution | OA Journals |
| issn | 1815-4816 2311-7990 |
| language | English |
| publishDate | 2006-12-01 |
| publisher | Mosul University |
| record_format | Article |
| series | Al-Rafidain Journal of Computer Sciences and Mathematics |
| spelling | doaj-art-fbcdcfa05041487dad81d6c7d41293942025-08-20T01:50:57ZengMosul UniversityAl-Rafidain Journal of Computer Sciences and Mathematics1815-48162311-79902006-12-013210312010.33899/csmj.2006.164061164061Weiner Polynomials for Generalization of Distance for Some Special GraphsAli Ali0Ahmed Ali1Academic Professor University of Mosul, Mosul, IraqCollege of Computer Sciences and Mathematics University of Mosul, Mosul, IraqThe minimum distance of a vertex v to an set of vertices of a graph G is defined as :<br /> .<br /> The n-Wiener polynomial for this distance of a graph G is defined as<br /> ,<br /> where is the number of order pairs (v,S), , such that<br /> ,<br /> and is the diameter for this minimum n-distance.<br /> In this paper, the n-Wiener polynomials for some types of graphs such as complete graphs, bipartite graphs, star graphs, wheel graphs, path and cycle graphs are obtained .The n-Wiener index for each of these special graphs is given. Moreover, some properties of the coefficients of are established.<br />https://csmj.mosuljournals.com/article_164061_5e74c038280d8a110cd193d01570d5ac.pdfn-distancewiener polynomialspecial graphs |
| spellingShingle | Ali Ali Ahmed Ali Weiner Polynomials for Generalization of Distance for Some Special Graphs Al-Rafidain Journal of Computer Sciences and Mathematics n-distance wiener polynomial special graphs |
| title | Weiner Polynomials for Generalization of Distance for Some Special Graphs |
| title_full | Weiner Polynomials for Generalization of Distance for Some Special Graphs |
| title_fullStr | Weiner Polynomials for Generalization of Distance for Some Special Graphs |
| title_full_unstemmed | Weiner Polynomials for Generalization of Distance for Some Special Graphs |
| title_short | Weiner Polynomials for Generalization of Distance for Some Special Graphs |
| title_sort | weiner polynomials for generalization of distance for some special graphs |
| topic | n-distance wiener polynomial special graphs |
| url | https://csmj.mosuljournals.com/article_164061_5e74c038280d8a110cd193d01570d5ac.pdf |
| work_keys_str_mv | AT aliali weinerpolynomialsforgeneralizationofdistanceforsomespecialgraphs AT ahmedali weinerpolynomialsforgeneralizationofdistanceforsomespecialgraphs |