C. Elphick

activity

20122026

most citedUpper bounds for the achromatic and coloring numbers of a graph

2 citations · 13 across the 20 of their papers we have counts for

collaborators

Showing 2015Show all

2 papers · 1 filter

math.CO2015★ 2 cited

Upper bounds for the achromatic and coloring numbers of a graph

Baoyindureng Wu, Clive Elphick

Dvořák \emph{et al.} introduced a variant of the Randić index of a graph $G$ , denoted by $R^{'} (G)$ , where $R^{'} (G) = \sum_{uv \in E (G)} \frac{1}{m a x { d ( u ) , d ( v )}}$ , and $d (u)$ denotes th…

math.CO2015★ 1 cited

Bounds and power means for the general Randic index

Clive Elphick, Pawel Wocjan

We review bounds for the general Randić index, $R_{α} = \sum_{ij \in E} (d_{i} d_{j})^{α}$ , and use the power mean inequality to prove, for example, that $R_{α} \geq m λ^{2 α}$ for $α < 0$ , where…