Pregled bibliografske jedinice broj: 787583
Bounds and Relations Involving Adjusted Centrality of the Vertices of a Tree
Bounds and Relations Involving Adjusted Centrality of the Vertices of a Tree // Graphs and combinatorics, 31 (2015), 6; 2319-2334 (međunarodna recenzija, članak, znanstveni)
CROSBI ID: 787583 Za ispravke kontaktirajte CROSBI podršku putem web obrasca
Naslov
Bounds and Relations Involving Adjusted Centrality of the Vertices of a Tree
Autori
Majstorović, Snježana ; Caporossi, Gilles
Izvornik
Graphs and combinatorics (0911-0119) 31
(2015), 6;
2319-2334
Vrsta, podvrsta i kategorija rada
Radovi u časopisima, članak, znanstveni
Ključne riječi
Adjusted centrality Edge betweenness Transmission Distance Tree graphs
Sažetak
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.
Izvorni jezik
Engleski
Znanstvena područja
Matematika
POVEZANOST RADA
Ustanove:
Sveučilište u Osijeku, Odjel za matematiku
Profili:
Snježana Majstorović
(autor)
Citiraj ovu publikaciju:
Časopis indeksira:
- Web of Science Core Collection (WoSCC)
- Science Citation Index Expanded (SCI-EXP)
- SCI-EXP, SSCI i/ili A&HCI
- Scopus
