A c-vertex-ranking of a graph G, for a positive integer c, is a labeling of the vertices of G with integers such that, for any label i deletion of all vertices with labels > i leaves connected components, each having at most c vertices with label i. The c-vertex-ranking problem is to find a covert ex-ranking of a graph using least number of ranks. In… (More)

@article{Hashem2006AnAF,
title={An Algorithm for c-Vertex-Ranking of Starlike Graphs},
author={Thomas Hashem and U. K. Paul and Md. Abul Kashem},
journal={2006 International Conference on Electrical and Computer Engineering},
year={2006},
pages={316-319}
}