|
|
|
|
Bulletin: Classe des sciences mathématiques et natturalles - Sciences mathématiques 2006, vol. 133, br. 31, str. 1-5
|
|
Graph connectivity and Wiener index
(naslov ne postoji na srpskom)
aUniverzitet u Kragujevcu, Prirodno-matematički fakultet
bDepartment of Applied Mathematics Northwestern Polytechnical University Xi'an, Shaanxi, P. R. China
Sažetak(ne postoji na srpskom) The graphs with a given number n of vertices and given (vertex or edge) connectivity k, having minimum Wiener index are determined. In both cases this is Kk + (K1 U Kn-k-1), the graph obtained by connecting all vertices of the complete graph Kk with all vertices of the graph whose two components are Kn-k-1 and K1. AMS Mathematics Subject Classification (2000): 05C12, 05C40 05C35.
Ključne reči
|
|
|
|
Reference
|
|
67
|
Bondy, J.A., Murty, U.S.R. (1976) Graph theory with applications. London-New York, itd: Macmillan
|
|
   49
|
Dobrynin, A.A., Entringer, R., Gutman, I. (2001) Wiener index of trees: Theory and applications
|
|
35
|
Dobrynin, A.A., Gutman, I., Klavžar, S., Žigert, P. (2002) Wiener index of hexagonal systems
|
|
24
|
Entringer, R.C., Jackson, D.E., Snyder, D.A. (1976) Distance in graphs. Czechoslovak Math. J., 26(101), 2, 283-296
|
|
27
|
Gutman, I., Yeh, Y.N., Lee, S.L., Luo, Y.L. (1993) Some recent results in the theory of the Wiener number. Indian J Chem, 32A, 651-661
|
|
7
|
Plesnik, J. (1984) On the sum of all distances in a graph or digraph. Journal of Graph Theory, 8, 1, 1-21
|
|
8
|
Rouvray, D.H. (2002) The rich legacy of half century of the Wiener index. u: Rouvray D.H., King R.B. (ur.) Topology in chemistry: Discrete mathematics of molecules, Chichester: Horwood, str. 16-37
|
|
|
|
|