The metric dimension of circulant graphs and their Cartesian products
Let \(G=(V,E)\) be a connected graph (or hypergraph) and let \(d(x,y)\) denote the distance between vertices \(x,y\in V(G)\). A subset \(W\subseteq V(G)\) is called a resolving set for \(G\) if for every pair of distinct vertices \(x,y\in V(G)\), there is \(w\in W\) such that \(d(x,w)\neq d(y,w)\)....
保存先:
| 主要な著者: | , |
|---|---|
| フォーマット: | Artigo |
| 言語: | Inglês |
| 出版事項: |
AGH Univeristy of Science and Technology Press
2017-01-01
|
| シリーズ: | Opuscula Mathematica |
| 主題: | |
| オンライン･アクセス: | http://www.opuscula.agh.edu.pl/vol37/4/art/opuscula_math_3726.pdf |
| タグ: |
タグなし, このレコードへの初めてのタグを付けませんか!
|