On ρ-labelings of Trees
碩士 === 中原大學 === 應用數學研究所 === 92 === A decomposition of a graph G is a family of subgraphs of G such that each edge of G is contained in exactly one number of . A H-decomposition of a graph G is a decomposition of G into subgraphs isomorphic to H . A vertex-labeling f is mapping of V(G) into a set...
| Main Authors: | , |
|---|---|
| Other Authors: | |
| Format: | Others |
| Language: | zh-TW |
| Online Access: | http://ndltd.ncl.edu.tw/handle/554xp4 |