Recent Submissions

  • The metric dimension and metric independence of a graph

    Currie, James;Oellerman, Ortrud R. (The Charles Babbage Research Centre,2001)
    一个图G的顶点x的决心s two vertices u and v of G if the distance from x to u does not equal the distance from x to v. A set S of vertices of G is a resolving set for G if every two distinct vertices of G are ...