Maximum induced subgraph of the generalized hypercube graph
碩士 === 明新科技大學 === 資訊管理研究所 === 96 === The topological structure of an interconnection network can be modeled by a graph G = (V, E) where V is the vertex set and E the edge set of G. For a vertex subset V′ of graph G, the subgraph of G induced by V′, denoted by G[V′], is a graph with vertex set V′ and...
| Main Author: | |
|---|---|
| Other Authors: | |
| Format: | Others |
| Language: | zh-TW |
| Published: |
2008
|
| Online Access: | http://ndltd.ncl.edu.tw/handle/06749453424265168969 |