arXiv (All)
open access
Betweenness centers of graphs
The betweenness centrality of a vertex $v$ in a graph $G = (V,E)$ is the sum of the relative numbers of shortest paths of $G$ that pass through $v$. The vertices of $G$ which have the maximum (resp. minimum) betweenness induce the betweenness center (resp. betweenness periphery) of $G$. We study bet
Conceptio Open Archive
Analyze & explore related research in Conceptio
Connect this record directly into your research workflow or AI agent. Explore citations across open repositories, query full text, and export structured proof bundles.
This document is indexed with metadata only: full text is not available in the archive for this record. Open the official source ↗
Related documents
- Centrality of shortest paths: Algorithms and complexity results#1062738
- A Network Formation Game for Katz Centrality Maximization: A Resource Allocation Perspective#1048320
- Past-aware game-theoretic centrality: a framework for cardinality-constrained set-function maximization on networks#984926
- Graph-based distributed Nash equilibrium seeking for potential games#239127
- Large induced subgraphs with $k$ vertices of maximum degree#822116
Record · ID 987100
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Bring this data into your agent: Connect via MCP or API · 20 free credits to start · no card required
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive