hrcak mascot   Srce   HID

Izvorni znanstveni članak
https://doi.org/10.21857/94kl4cxxjm

One-alpha weighted network descriptors

Tanja Vojković ; Department of Mathematics, Faculty of Science, University of Split, 21000 Split, Croatia
Damir Vukičević ; Department of Mathematics, Faculty of Science, University of Split, 21000 Split, Croatia

Puni tekst: engleski, pdf (255 KB) str. 31-49 preuzimanja: 347* citiraj
APA 6th Edition
Vojković, T. i Vukičević, D. (2019). One-alpha weighted network descriptors. Rad Hrvatske akademije znanosti i umjetnosti, (538=23), 31-49. https://doi.org/10.21857/94kl4cxxjm
MLA 8th Edition
Vojković, Tanja i Damir Vukičević. "One-alpha weighted network descriptors." Rad Hrvatske akademije znanosti i umjetnosti, vol. , br. 538=23, 2019, str. 31-49. https://doi.org/10.21857/94kl4cxxjm. Citirano 23.09.2021.
Chicago 17th Edition
Vojković, Tanja i Damir Vukičević. "One-alpha weighted network descriptors." Rad Hrvatske akademije znanosti i umjetnosti , br. 538=23 (2019): 31-49. https://doi.org/10.21857/94kl4cxxjm
Harvard
Vojković, T., i Vukičević, D. (2019). 'One-alpha weighted network descriptors', Rad Hrvatske akademije znanosti i umjetnosti, (538=23), str. 31-49. https://doi.org/10.21857/94kl4cxxjm
Vancouver
Vojković T, Vukičević D. One-alpha weighted network descriptors. Rad Hrvatske akademije znanosti i umjetnosti [Internet]. 2019 [pristupljeno 23.09.2021.];(538=23):31-49. https://doi.org/10.21857/94kl4cxxjm
IEEE
T. Vojković i D. Vukičević, "One-alpha weighted network descriptors", Rad Hrvatske akademije znanosti i umjetnosti, vol., br. 538=23, str. 31-49, 2019. [Online]. https://doi.org/10.21857/94kl4cxxjm

Sažetak
Complex networks are often used to model objects and their relations. Network descriptors are graph-theoretical invariants assigned to graphs that correspond to complex networks. Transmission and betweenness centrality are well known network descriptors and networkness and network surplus have been recently analyzed. All these four descriptors are based on the unrealistic assumption about equal communication between all vertices. Here, we amend this by assuming that vertices on the distance larger then one communicate less than those that are neighbors. We analyze network descriptors for all possible values of the factor that measures reduction in the communication of the vertices that are not neighbors. We term these descriptors one-alpha descriptors and determine their extremal values.

Ključne riječi
Network descriptors; complex networks; extremal graph theory.

Projekti
MZOS / ZP / 037-0000000-2779 - Diskretna matematika i primjene
MZOS / ZP / 177-0000000-0884 - Diskretni matematički modeli u kemiji

Hrčak ID: 225228

URI
https://hrcak.srce.hr/225228

Posjeta: 525 *