The n-Hosoya Polynomials of the Square of a Path and of a Cycle
The n-Hosoya polynomial of a connected graph G of order t is defined by:<br /> Hn (G;x) = ∑ Cn (G;x) xk, where, Cn(G,k) is the number of pairs (v,S), in which |S| = n -1, 3 ≤ n ≤ t, v <span>∈</span><span> </span>V(G) , S <span>⊆</span> V (G) , such that dn(...
| Main Author: | |
|---|---|
| Format: | Article |
| Language: | Arabic |
| Published: |
Mosul University
2021-06-01
|
| Series: | Al-Rafidain Journal of Computer Sciences and Mathematics |
| Subjects: | |
| Online Access: | https://csmj.mosuljournals.com/article_168250_f814ef63e427a5a00951e6e00d7b7dc5.pdf |