Betweenness centrality in convex amalgamation of graphs

MaRDI QIDQ5241183zbMATH OpenFDO

Authors Sunil Kumar Raghavan Unnithan, Kannan Balakrishnan

Publication date 30 October 2019

zbMATH Keywords

central vertexconvex subgraphbetweenness centralityextreme vertexvertex amalgamationedge amalgamationpath amalgamationsubgraph amalgamation

Mathematics Subject Classification ID

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

Recommendations

• Betweenness centrality in Cartesian product of graphs
• Betweenness centrality in some classes of graphs
• scientific article; zbMATH DE number 6096696
• Notes on the betweenness centrality of a graph
• Centrality measure in graphs

Cites work

• A faster algorithm for betweenness centrality*
• Betweenness centrality in some classes of graphs
• On the corona of two graphs
• On the number of geodesics of Petersen graph \(\mathrm{GP}(n,2)\)
• The Number of Linear, Directed, Rooted, and Connected Graphs
• The cordiality of one-point union of n copies of a graph

Cited in

(8)

• scientific article; zbMATH DE number 6096696 (Why is no real title available?)
• On the connectivity and the diameter of betweenness-uniform graphs
• Convex combinations of centrality measures
• Betweenness centrality in Cartesian product of graphs
• Betweenness centrality in Cartesian product of graphs
• On the connectivity and the diameter of betweenness-uniform graphs
• scientific article; zbMATH DE number 7708854 (Why is no real title available?)
• Centrality betweenness in some join of graphs

This page was built for publication: Betweenness centrality in convex amalgamation of graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5241183)