| Balanced $k$-decompositions of graphs | |
|---|---|
| 學年 | 100 |
| 學期 | 2 |
| 出版（發表）日期 | 2012-07-01 |
| 作品名稱 | Balanced $k$-decompositions of graphs |
| 作品名稱（其他語言） | |
| 著者 | Hsiang-Chun Hsu; Gerard Jennhwa Chang |
| 單位 | |
| 出版者 | |
| 著錄名稱、卷期、頁數 | Discrete Applied Mathematics 160(10-11), p.1639-1642 |
| 摘要 | For a given integer , a balanced-coloring of a graph is a mapping such that for , where for . The balanced -decomposition number of is the minimum integer with the property that for any balanced -coloring there is a partition such that induces a connected subgraph with and for and . In this paper, we determine for some graphs of high connectivity, trees and complete multipartite graphs. |
| 關鍵字 | Balanced;k-coloringBalanced;k-decompositionp;Connectivity;Tree;Complete multipartite graphs |
| 語言 | en_US |
| ISSN | |
| 期刊性質 | 國外 |
| 收錄於 | SCI |
| 產學合作 | |
| 通訊作者 | |
| 審稿制度 | 是 |
| 國別 | TWN |
| 公開徵稿 | |
| 出版型式 | ,電子版 |
| 相關連結 |
機構典藏連結 ( http://tkuir.lib.tku.edu.tw:8080/dspace/handle/987654321/115404 ) |
| SDGS | 優質教育 |
GoogleAnalytics