• English
    • français
  • English 
    • English
    • français
Search 
  •   WinnSpace Home
  • Department of Mathematics and Statistics
  • Search
  •   WinnSpace Home
  • Department of Mathematics and Statistics
  • Search
JavaScript is disabled for your browser. Some features of this site may not work without it.

Search

Show Advanced FiltersHide Advanced Filters

Filters

Use filters to refine the search results.

Now showing items 1-1 of 1

  • Sort Options:
  • Relevance
  • Title Asc
  • Title Desc
  • Issue Date Asc
  • Issue Date Desc
  • Results Per Page:
  • 5
  • 10
  • 20
  • 40
  • 60
  • 80
  • 100
Thumbnail

The metric dimension and metric independence of a graph 

Currie, James; Oellerman, Ortrud R. (The Charles Babbage Research Centre, 2001)
A vertex x of a graph G resolves 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 ...

Report a copyright concern

Contact Us | Send Feedback
 

 

Browse

All of WinnSpaceCommunities & CollectionsBy Issue DateAuthorsTitlesSubjectsThis CommunityBy Issue DateAuthorsTitlesSubjects

My Account

LoginRegister

Discover

Author
Currie, James (1)
Oellerman, Ortrud R. (1)Subject
graphs, metric dimension, metric independence (1)
... View MoreDate Issued2001 (1)Has File(s)Yes (1)

Report a copyright concern

Contact Us | Send Feedback