engleski

One-alpha weighted network descriptors

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 alpha 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.

network descriptors ; complex networks ; extremal graph theory

nije evidentirano