Abstract:In this paper, we introduce the diametral covering number of a graph. A subset S of V(G) is said to be a diametral cover for G if every diametral path of G contains at least one vertex of S. The minimum cardinality of S taken over all diametral covers is called the diametral covering number of G and is denoted by σd(G). Here we have given the diametral covering number of several classes of graphs and have given bounds for the same in terms of basic graph parameters. Also, a characterization of graphs having pa… Show more
Set email alert for when this publication receives citations?
scite is a Brooklyn-based organization that helps researchers better discover and understand research articles through Smart Citations–citations that display the context of the citation and describe whether the article provides supporting or contrasting evidence. scite is used by students and researchers from around the world and is funded in part by the National Science Foundation and the National Institute on Drug Abuse of the National Institutes of Health.