scientific article; zbMATH DE number 7124341
From MaRDI portal
Publication:5241183
zbMath1425.05137MaRDI QIDQ5241183
Sunil Kumar Raghavan Unnithan, Kannan Balakrishnan
Publication date: 30 October 2019
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
central vertexconvex subgraphbetweenness centralityextreme vertexvertex amalgamationedge amalgamationpath amalgamationsubgraph amalgamation
Small world graphs, complex networks (graph-theoretic aspects) (05C82) Graph algorithms (graph-theoretic aspects) (05C85) Graph operations (line graphs, products, etc.) (05C76)
Related Items (2)
On the connectivity and the diameter of betweenness-uniform graphs ⋮ On the connectivity and the diameter of betweenness-uniform graphs
Cites Work
- The cordiality of one-point union of \(n\) copies of a graph
- Betweenness centrality in some classes of graphs
- On the number of geodesics of Petersen graph \(\mathrm{GP}(n,2)\)
- On the corona of two graphs
- A faster algorithm for betweenness centrality*
- The Number of Linear, Directed, Rooted, and Connected Graphs
This page was built for publication:
