A stronger relation between coloring number and the modification of Randić index.
From MaRDI portal
Publication:4598965
zbMATH Open1424.05059MaRDI QIDQ4598965FDOQ4598965
Authors: Renfang Wu, Hanyuan Deng
Publication date: 15 December 2017
Recommendations
- Randić index and coloring number of a graph
- Upper bounds for the achromatic and coloring numbers of a graph
- On a relation between the Randić index and the chromatic number
- Variable neighborhood search for extremal graphs. 23. On the Randić index and the chromatic number
- On \(R^\prime\) index of a graph.
Cited In (6)
- Randić index and coloring number of a graph
- On a relation between the Randić index and the chromatic number
- Variable neighborhood search for extremal graphs. 23. On the Randić index and the chromatic number
- On \(R^\prime\) index of a graph.
- Some tight bounds for the harmonic index and the variation of the Randić index of graphs
- Upper bounds for the achromatic and coloring numbers of a graph
Uses Software
This page was built for publication: A stronger relation between coloring number and the modification of Randić index.
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4598965)