Geodetic Numbers of Graphs
碩士 === 國立臺灣大學 === 數學研究所 === 93 === All graphs in this thesis are simple, i.e., finite, undirected, loopless and without multiple edges. For any two vertices u and v of a graph G, a u-v geodesic is a path of length d(u, v). The set I(u, v) consists of all vertices lying on some u-v geodesic of G.. If...
| Main Authors: | , |
|---|---|
| Other Authors: | |
| Format: | Others |
| Language: | en_US |
| Published: |
2005
|
| Online Access: | http://ndltd.ncl.edu.tw/handle/06443441011545300020 |