On 2-equitable graphs
2020
Let Π be an equitable partition of a graph G with k cells. If G has no equitable partition with fewer cells than Π, then Π is called a minimal partition of G and G is called a k-equitable graph. It...
Keywords:
- Correction
- Source
- Cite
- Save
- Machine Reading By IdeaReader
16
References
0
Citations
NaN
KQI