arXiv (All)
open access
On harmonic centers of graphs
The harmonic centrality of a vertex $v$ in a graph $G = (V,E)$ is the sum of reciprocals of distances of vertices of $G$ from $v$. The vertices of $G$ which have the maximum (minimum) harmonic centrality form the harmonic center (or periphery, resp.) of $G$. We study harmonic centers of graphs and t
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
- Tight minimum degree conditions for apex-outerplanar minors and subdivisions in graphs and digraphs#987368
- Near-Optimal Distributed Domination in Planar Graphs#1117067
- Near-Optimal Distributed 2-Ruling Sets on Graphs with Low Arboricity#271808
- Beyond halfway to Hadwiger's conjecture#987876
- Les statistiques sur l'outre-mer#970999
Record · ID 1105853
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