The Hull Numbers of Orientations of Graphs
碩士 === 國立中山大學 === 應用數學系研究所 === 94 === For every pair of vertices $u,v$ in an oriented graph, a $u$-$v$ $geodesic$ is a shortest directed path from $u$ to $v$. For an oriented graph $D$, let $I_{D}[u,v]$ denoted the set of all vertices lying on a $u$-$v$ geodesic or a $v$-$u$ geodesic. And for $Ssubs...
| Main Authors: | , |
|---|---|
| Other Authors: | |
| Format: | Others |
| Language: | en_US |
| Published: |
2006
|
| Online Access: | http://ndltd.ncl.edu.tw/handle/31256988518892870051 |