A Study on Distance-Hereditary Graphs
碩士 === 國立中正大學 === 資訊工程學系 === 84 === A distance-hereditary graph G = (V,E) is a connected graph with that every two vertices have the same distance in every connected induced subgraph of G. A Hamiltonian circuit of a graph G is a simpl...
| Main Authors: | , |
|---|---|
| Other Authors: | |
| Format: | Others |
| Language: | zh-TW |
| Published: |
1996
|
| Online Access: | http://ndltd.ncl.edu.tw/handle/11987912923285066259 |