- All Journals
- Al-Qadisiyah University
- Basrah University
- Kirkuk University
- Mosul University
- The Iraqi Borad for Medical Specialization
- University of Anbar
- University of Technology
- Al Mustafa University
- Al-Zahraa University for Women
- Alnoor University
- Kunooz University
- Misan University
- Ninevah University
- Tikrit University
- University of Al-Hamdaniya
- University of Kerbala
w-Hosoya Polynomials for Connection for Some Special Graphs | ||
| AL-Rafidain Journal of Computer Sciences and Mathematics | ||
| Article 30, Volume 9, Issue 2, 2012, Pages 173-184 PDF (503.01 K) | ||
| Document Type: Research Paper | ||
| DOI: 10.33899/csmj.2012.163726 | ||
| Authors | ||
| Ahmed M. Ali1; Assma Salah Aziz2; Hafen Jalal Ahmed3 | ||
| 1College of Computer Science and Mathematics Mosul University, | ||
| 2College of Computer Science and Mathematics Mosul University, | ||
| 3College of Science Duhok University | ||
| Abstract | ||
| Let and be any two distinct vertices in a connected graph . A container is a set of internally disjoint - paths. The width of is denoted by or is , and the length of is the length of the longest - path in . Then, for a given positive integer w, the width distance between any two distinct vertices u and v in a connected graph is define by: , where the minimum is taken over all containers of width w. In this paper, we find the Hosoya polynomials, and Wiener indices of the join of two special graphs such as bipartite complete graphs, paths, cycles, star graphs and wheel graphs with respect to the width distance. | ||
| Keywords | ||
| Width Distance; w-Hosoya polynomials; Special graphs | ||
|
Statistics Article View: 294 PDF Download: 288 |
||