|
|
|
|
CONTRIBUTORS:
|
|
|
JOURNAL:
|
|
|
YEAR:
|
2011
|
|
PUB TYPE:
|
Journal Article
|
|
SUBJECT(S):
|
chemistry - mathematical
|
|
DISCIPLINE:
|
Chemistry
|
|
HTTP:
|
|
|
LANGUAGE:
|
English
|
|
PUB ID:
|
103-501-580
(Last edited on
2012/04/04 03:13:33 GMT-6)
|
|
SPONSOR(S):
|
|
|
ABSTRACT:
Let G be a simple connected graph. The Gutman index S(G) is defined as S(G) = Σu,v∈V(G) dG(u)dG(v)d(u v) where dG(u) is the degree of u, d(u v) is the distance between u and i; and the summation goes over all pairs of vertices in G. In this paper, we determine that among all bicyclic graphs of order n, the graph formed from two triangles linked by a path has maximal Gutman index.
|
|
|
|
STATISTICS
|
|
Click on # to view
|
|
Citations
|
|
0
|
|
References
|
|
1
|
|
Comments
|
|
0
|
|
Quality
|
|
0/0.00
|
|
Interest
|
|
0/0.00
|
|
View(er)s
|
|
1/136
|
|
|
|
|
|
|
| Prev |
Next |
|
