Zobrazeno 1 - 7
of 7
pro vyhledávání: '"Hauweele, Pierre"'
A coloring of a graph is an assignment of colors to its vertices such that adjacent vertices have different colors. Two colorings are equivalent if they induce the same partition of the vertex set into color classes. Let $\mathcal{A}(G)$ be the avera
Externí odkaz:
http://arxiv.org/abs/2105.01120
The eccentric connectivity index of a connected graph $G$ is the sum over all vertices $v$ of the product $d_{G}(v) e_{G}(v)$, where $d_{G}(v)$ is the degree of $v$ in $G$ and $e_{G}(v)$ is the maximum distance between $v$ and any other vertex of $G$
Externí odkaz:
http://arxiv.org/abs/1809.03158
The eccentricity of a vertex $v$ in a graph $G$ is the maximum distance between $v$ and any other vertex of $G$. The diameter of a graph $G$ is the maximum eccentricity of a vertex in $G$. The eccentric connectivity index of a connected graph is the
Externí odkaz:
http://arxiv.org/abs/1808.10203
Extremal Graph Theory aims to determine bounds for graph invariants as well as the graphs attaining those bounds. We are currently developping PHOEG, an ecosystem of tools designed to help researchers in Extremal Graph Theory. It uses a big relationa
Externí odkaz:
http://arxiv.org/abs/1712.07861
Publikováno v:
In Discrete Applied Mathematics 15 September 2019 268:102-111
Publikováno v:
Yugoslav Journal of Operations Research, Vol 29, Iss 2, Pp 193-202 (2019)
The eccentric connectivity index of a connected graph G is the sum over all vertices v of the product dG(v)eG(v), where dG(v) is the degree of v in G and eG(v) is the maximum distance between v and any other vertex of G. We characterize, with a new e
Externí odkaz:
https://doaj.org/article/98575346a9b54b1fb9562a30b747b57c
Akademický článek
Tento výsledek nelze pro nepřihlášené uživatele zobrazit.
K zobrazení výsledku je třeba se přihlásit.
K zobrazení výsledku je třeba se přihlásit.