Молимо вас користите овај идентификатор за цитирање или овај линк до ове ставке:
https://scidar.kg.ac.rs/handle/123456789/10317
Пун извештај метаподатака
Поље DC-а | Вредност | Језик |
---|---|---|
dc.rights.license | restrictedAccess | - |
dc.contributor.author | Divnić T. | - |
dc.contributor.author | Pavlović, Ljiljana | - |
dc.date.accessioned | 2021-04-20T15:26:32Z | - |
dc.date.available | 2021-04-20T15:26:32Z | - |
dc.date.issued | 2013 | - |
dc.identifier.issn | 0166-218X | - |
dc.identifier.uri | https://scidar.kg.ac.rs/handle/123456789/10317 | - |
dc.description.abstract | Let G(k,n) be the set of connected simple n-vertex graphs with minimum vertex degree k. The Randić index R(G) of a graph G is defined by: R(G)=σuv∈E(G)1d(u)d(v), where d(u) is the degree of vertex u and the summation extends over all edges uv of G. In this paper we prove for k≤n2 the conjecture of Aouchiche and Hansen about the graphs in G(k,n) for which the Randić index attains its minimum value. We show that the extremal graphs are complete split graphs Kk,n-k-, which have only two degrees, i.e. degree k and degree n-1, and the number of vertices of degree k is n-k, while the number of vertices of degree n-1 is k. At the end we generalize our results to graphs with prescribed maximum degree q. | - |
dc.rights | info:eu-repo/semantics/restrictedAccess | - |
dc.source | Discrete Applied Mathematics | - |
dc.title | Proof of the first part of the conjecture of Aouchiche and Hansen about the Randić index | - |
dc.type | article | - |
dc.identifier.doi | 10.1016/j.dam.2012.11.004 | - |
dc.identifier.scopus | 2-s2.0-84875228970 | - |
Налази се у колекцијама: | Faculty of Science, Kragujevac |
Датотеке у овој ставци:
Датотека | Опис | Величина | Формат | |
---|---|---|---|---|
PaperMissing.pdf Ограничен приступ | 29.86 kB | Adobe PDF | ![]() Погледајте |
Ставке на SCIDAR-у су заштићене ауторским правима, са свим правима задржаним, осим ако није другачије назначено.