Antipodal graphs and digraphs
The antipodal graph of a graph G, denoted by A(G), has the same vertex set as G with an edge joining vertices u and v if d(u,v) is equal to the diameter of G. (If G is disconnected, then diam G=∞.) This definition is extended to a digraph D where the arc (u,v) is included in A(D) if d(u,v) is the di...
保存先:
| 主要な著者: | , |
|---|---|
| フォーマット: | Artigo |
| 言語: | Inglês |
| 出版事項: |
Wiley
1993-01-01
|
| シリーズ: | International Journal of Mathematics and Mathematical Sciences |
| 主題: | |
| オンライン･アクセス: | http://dx.doi.org/10.1155/S0161171293000717 |
| タグ: |
タグなし, このレコードへの初めてのタグを付けませんか!
|