Abstract
The vertex identified and edge introducing graphs of two disjoint connected graphs are extended to n, , disjoint connected graphs. Hosoya polynomials and Wiener indices of such composite graphs are obtained by applying Gutman's Theorem and using mathematical induction on n.
The article was added to IASJ on 2013-11-17
222 Total full text downloads since the date of addition
Year |
Total |
Jan |
Feb |
Mar |
Apr |
May |
Jun |
Jul |
Aug |
Sep |
Oct |
Nov |
Dec |
2024 |
2 |
1 |
1 |
|
|
|
|
|
|
|
|
|
|
2023 |
13 |
|
|
2 |
1 |
|
1 |
|
2 |
1 |
1 |
3 |
2 |
2022 |
34 |
7 |
2 |
1 |
6 |
2 |
2 |
4 |
4 |
3 |
1 |
2 |
|
2021 |
25 |
|
5 |
|
|
3 |
5 |
|
1 |
2 |
1 |
2 |
6 |
2020 |
25 |
|
2 |
4 |
3 |
|
5 |
1 |
|
3 |
2 |
3 |
2 |
2019 |
18 |
1 |
|
1 |
1 |
1 |
5 |
2 |
1 |
3 |
2 |
1 |
|
2018 |
11 |
2 |
|
|
|
|
2 |
|
|
|
4 |
2 |
1 |
2017 |
15 |
1 |
1 |
|
1 |
1 |
|
1 |
2 |
1 |
1 |
|
6 |
2016 |
18 |
|
2 |
1 |
2 |
|
4 |
1 |
5 |
2 |
|
|
1 |
2015 |
24 |
|
|
5 |
1 |
|
3 |
2 |
1 |
1 |
11 |
|
|
2014 |
35 |
|
|
|
|
1 |
|
2 |
1 |
11 |
2 |
1 |
17 |
2013 |
2 |
|
|
|
|
|
|
|
|
|
|
1 |
1 |
Usage is updated on a monthly basis.