Connectivity of Small Cages
碩士 === 國立交通大學 === 應用數學系 === 91 === A regular graph G of degree δ and girth g is said to be a (δ, g)-graph, and a (δ, g)- cage is a smallest graph among all (δ, g)-graphs. A graph is κ-connected if every cutset has cardinality at least κ. It was proved by Marcote et al that a (δ, g)-cage i...
| Main Authors: | , |
|---|---|
| Other Authors: | |
| Format: | Others |
| Language: | en_US |
| Published: |
2003
|
| Online Access: | http://ndltd.ncl.edu.tw/handle/13669327353972731674 |