盡可能擁擠
給定一個有n個頂點的簡單圖 G,將頂點標號為1,2,…n;考慮 任意相鄰的兩頂點標號和中最大值的最小值,稱此極值發生時的標號為圖G的擁擠標號。在這個研究中,我們得出方格表、m×n×l長方體、環狀圖、圓柱圖及樹圖的擁擠標號和其極值的通式,並討論相關的問題。 Given a simplicial graph G of n vertices, label the vertices with 1,2,…n. Consider the minimum of the maximum of the sum of any two close vertices’ labeling, and we call the labeling that has this extremum the “crowded labeling”. In this study, we found out the “crowded labeling” and the common equation of the grid, m×n×l cuboid, cycle, cylinder, and trees. And discuss the correlative questions.