Nalazite se na CroRIS probnoj okolini. Ovdje evidentirani podaci neće biti pohranjeni u Informacijskom sustavu znanosti RH. Ako je ovo greška, CroRIS produkcijskoj okolini moguće je pristupi putem poveznice www.croris.hr
izvor podataka: crosbi !

Bounds and Relations Involving Adjusted Centrality of the Vertices of a Tree (CROSBI ID 222653)

Prilog u časopisu | izvorni znanstveni rad | međunarodna recenzija

Majstorović, Snježana ; Caporossi, Gilles Bounds and Relations Involving Adjusted Centrality of the Vertices of a Tree // Graphs and combinatorics, 31 (2015), 6; 2319-2334

Podaci o odgovornosti

Majstorović, Snježana ; Caporossi, Gilles

engleski

Bounds and Relations Involving Adjusted Centrality of the Vertices of a Tree

Edge betweenness is a measure of the influence of edges in networks. The edge betweenness of an edge is defined to be the number of shortest paths between pairs of vertices that run along it. For a given graph G=(V(G), E(G)), the adjusted betweenness centrality c∗v of a vertex v∈V(G) is defined to be the sum of the edge betweenness of all the edges incident to v. In this paper we study the mathematical properties of c∗v for vertices in trees. We present lower and upper bounds for c∗v in terms of the number of vertices, vertex degree, eccentricity, transmission, maximum degree, diameter, and radius.

Adjusted centrality Edge betweenness Transmission Distance Tree graphs

nije evidentirano

nije evidentirano

nije evidentirano

nije evidentirano

nije evidentirano

nije evidentirano

Podaci o izdanju

31 (6)

2015.

2319-2334

objavljeno

0911-0119

Povezanost rada

Matematika

Indeksiranost