arXiv (OAI Expanded)
open access
Eccentric Connectivity Index of Cartesian product and Strong product of Strongly Connected Digraphs
Let $G=(V,E)$ be a graph. The \emph{eccentric connectivity index} of $G$ is defined as $$ξ^C(G)=\sum_{u\in V(G)}d_uecc(u)$$ where $d_u$ and $ecc(u)$ are the degree and eccentricity of $u$, respectively. For a strongly connected digraph $D=(V,A)$, the eccentric connectivity index is defined as $$ξ^C(
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
- Martingale central limit theorems in $p$-Wasserstein distance#999080
- A Local Central Limit Theorem for Clique Counts in Sparse Random Graphs#625427
- A Local Central Limit Theorem for Clique Counts in Sparse Random Graphs#623154
- Estimates for $L^p$ variants of Gowers norms#986538
- Vaught's Conjecture for Sums of Products of Rooted Trees#1076262
Record · ID 1083273
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