Mathematical Research Data Initiative
Main page
Recent changes
Random page
Help about MediaWiki
Create a new Item
Create a new Property
Create a new EntitySchema
Merge two items
In other projects
Discussion
View source
View history
Purge
English
Log in

The directed distance dimension of oriented graphs

From MaRDI portal
Publication:2713683
Jump to:navigation, search

DOI10.21136/mb.2000.125961zbMath0963.05045OpenAlexW2601871908MaRDI QIDQ2713683

Ping Zhang, Gary Chartrand, Michael E. Raines

Publication date: 10 June 2001

Full work available at URL: https://eudml.org/doc/29115


zbMATH Keywords

dimensionoriented graphsdirected distanceresolving sets


Mathematics Subject Classification ID

Distance in graphs (05C12) Directed graphs (digraphs), tournaments (05C20)


Related Items

The strong metric dimension of graphs and digraphs ⋮ Identifying codes on directed de Bruijn graphs ⋮ Getting the Lay of the Land in Discrete Space: A Survey of Metric Dimension and Its Applications ⋮ On finding the best and worst orientations for the metric dimension ⋮ The localization game on oriented graphs ⋮ On weak metric dimension of digraphs ⋮ Unnamed Item ⋮ Connected Resolvability of Graphs ⋮ Metric dimension of Cayley digraphs of split metacyclic groups ⋮ Metric dimension: from graphs to oriented graphs ⋮ Metric dimension: from graphs to oriented graphs ⋮ Resolvability and the upper dimension of graphs ⋮ The metric dimension of Cayley digraphs



Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:2713683&oldid=15564053"
Tools
What links here
Related changes
Special pages
Printable version
Permanent link
Page information
MaRDI portal item
This page was last edited on 3 February 2024, at 12:05.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki