Abstract:Let G be a simple connected graph with the vertex set V(G) and the set edge E(G). The set S ⊆ V(G) is called the kmetric generator on G if and only if every two different vertices in G are distinguished by at least k elements in S, in other words for every two different vertices u, v ∈ V(G), there are at least k vertices w 1 , w 2 , … , w k ∈ S such that d(u, w i ) ≠ d(v, w i ), for every i ∈ {1, … , k}. The k-metric generator with the smallest cardinality is called the k-metric base and the cardinality of the… 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.