The Convexity Spectra and the Strong Convexity Spectra of Graphs
碩士 === 國立中山大學 === 應用數學系研究所 === 93 === Given a connected oriented graph D, we say that a subset S of V(D) is convex in D if, for every pair of vertices x, y in S, the vertex set of every x-y geodesic (x-y shortest dipath) and y-x geodesic in D is contained in S. The convexity number con (D) of a nont...
| Main Authors: | , |
|---|---|
| Other Authors: | |
| Format: | Others |
| Language: | en_US |
| Published: |
2005
|
| Online Access: | http://ndltd.ncl.edu.tw/handle/71482277918834551270 |