Betweenness centrality in Cartesian product of graphs

DOI10.1016/j.akcej.2019.03.012zbMath1473.05257OpenAlexW2924452410MaRDI QIDQ5154628

Kannan Balakrishnan, Sunil Kumar R.

Publication date: 5 October 2021

Published in: AKCE International Journal of Graphs and Combinatorics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.akcej.2019.03.012

zbMATH Keywords

Cartesian productgeodetic graphbetweenness centralitypairwise dependency

Mathematics Subject Classification ID

Small world graphs, complex networks (graph-theoretic aspects) (05C82) Distance in graphs (05C12) Graph operations (line graphs, products, etc.) (05C76)

Related Items (3)

Stress of a graph and its computation ⋮ CLOSENESS CENTRALITY IN GRAPH PRODUCTS ⋮ Unnamed Item

Uses Software

• Brain Connectivity Toolbox

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• On the sum of all distances in composite graphs
• A faster algorithm for betweenness centrality*
• Quantitative Graph Theory
• Graphs with Given Group and Given Graph-Theoretical Properties
• Characterizing subgraphs of Hamming graphs
• The worldwide air transportation network: Anomalous centrality, community structure, and cities' global roles
• STACS 2005

This page was built for publication: Betweenness centrality in Cartesian product of graphs