arXiv (All)
open access
On the sum of eccentric subgraph numbers of the vertices of a connected graph
Let $G$ be a connected graph. The eccentric subgraph number $ε(v)$ of a vertex $v$ of $G$ is defined as $ε(v)=\min\{f_G(v,u): u\in V(G)\}$, where $f_G(v,u)$ is the number of connected subgraphs of $G$ containing both $v$ and $u$. The eccentric subgraph index $ES(G)$ of $G$ is defined as $ES(G)=\disp
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
- On the largest independent sets in the Kneser graph on chambers of PG(4,q)#350962
- Limits of descent-biased trees#1109458
- Endpoint Covering of Axis-Parallel Segments:Bichromatic and Monochromatic One-Center#1077748
- Piercing boxes and products of trees#1341591
- Shape Theorem for the Contact Process in a Dynamical Random Environment#1129104
Record · ID 1354383
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