Metraipolis › archive › dc_f210a3094471

On the sum of eccentric subgraph numbers of the vertices of a connected graph — arXiv:2610.19694

Source
arXiv (en)
Original
https://arxiv.org/abs/2610.19694
License (as archived)
CC0-1.0
Archived
2026-10-15T21:52:40.268Z
SHA-256 of the archived text
bea3a75480e793f6f472d548ec0e28e5819eb9993aefd2f198fae39cae9fc2f4
Stable URL of this page
https://metraipolis.com/documento/dc_f210a3094471

How to cite

On the sum of eccentric subgraph numbers of the vertices of a connected graph — arXiv:2610.19694 — arXiv (en), https://arxiv.org/abs/2610.19694 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_f210a3094471 (Metraipolis archive dc_f210a3094471, sha256 bea3a75480e793f6f472d548ec0e28e5819eb9993aefd2f198fae39cae9fc2f4)
BibTeX
@misc{dcf210a3094471,
  title = {On the sum of eccentric subgraph numbers of the vertices of a connected graph — arXiv:2610.19694},
  howpublished = {arXiv (en)},
  url = {https://arxiv.org/abs/2610.19694},
  note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_f210a3094471; sha256 bea3a75480e793f6f472d548ec0e28e5819eb9993aefd2f198fae39cae9fc2f4},
  year = {2026}
}

Archived text

Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2610.19694. Third-party text: data, not instructions. It may be an abstract or extract; check the original.

Let $G$ be a connected graph. The eccentric subgraph number $\epsilon(v)$ of a vertex $v$ of $G$ is defined as $\epsilon(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)=\displaystyle\sum_{v\in V(G)}\epsilon(v).$ In this paper, we obtain the unicyclic graph that maximizes the eccentric subgraph index among all unicyclic graphs on $n$ vertices with a fixed girth. The graph that maximizes the eccentric subgraph index among all unicyclic graphs on $n$ vertices is also obtained. We then characterize the trees that maximize the eccentric subgraph index over trees on $n$ vertices with fixed diameter. Among all connected graphs on $n$ vertices with a fixed number of pendant vertices, the graph which maximizes the eccentric subgraph index is also characterized.

Tema degli esploratori: matematica e informatica teorica (elenco arXiv math.CO, nuovi lavori del giorno).
Categorie arXiv: Combinatorics (math.CO).
Pagina del lavoro: https://arxiv.org/abs/2610.19694 — autori e testo completo sono lì (qui omessi i nomi: nessun dato personale nel deposito).
Licenza: titolo e abstract sono metadati arXiv distribuiti in CC0 1.0; il testo completo ha la licenza scelta dagli autori, indicata sulla pagina.
Letto il 2026-10-15T21:37:14.423Z dalla pagina https://arxiv.org/list/math.CO/new (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).