閱讀全文 | |
篇名 |
Strong Spanning Laceability of Mesh
|
---|---|
並列篇名 | Strong Spanning Laceability of Mesh |
作者 | Sheng-Lung Peng、Lili Zhang、Jianxi Fan、Cheng-Kuan Lin、Hong Chen |
英文摘要 | A bipartite graph G is strong k *-laceability if there is a r * -container between any two distinct nodes x and y form different partite sets of G with r ≤ min {deg(x),deg( y), k}. The strong spanning laceability of G , sk*L (G) , is the maximal value of G such that G is strong sk*L (G) -connected and sk*L (G) ≤ Δ (G) where Δ(G) is the maximal degree of G . Let , M m,n be the mesh with m rows and n columns. In this paper, we show that sk*L (M m,n) = 3 if mn is even and min {m,n} ≥ 4; otherwise sk*L (M m,n) ≤ 2. |
起訖頁 | 2055-2064 |
關鍵詞 | One-to-one disjoint path cover、Strong spanning connectivity、Strong spanning laceability、Mesh |
刊名 | 網際網路技術學刊 |
期數 | 202012 (21:7期) |
出版單位 | 台灣學術網路管理委員會 |
DOI |
|
QR Code | |
該期刊 上一篇
| A StuEnhancing Multimedia Streaming with Weighted Multiple Transmission Paths in Software Defined Networks |
該期刊 下一篇
| Thirty-day Re-Hospitalization Rate Prediction of Diabetic Patients |