Graphs with <i>k</i>-Role Assignments

• 作者: Yana Liu Yongqiang Zhao
• 来源期刊: 离散数学期刊(英文)
• 学科: 医学
• 关键词: NEIGHBORHOOD k-Role ASSIGNMENT Restricted Size k-Role ASSIGNMENT k-Threshold Close Role ASSIGNMENT
• 年，卷（期）: 2017,（3）
• 页码范围: 177-184
• 页数: 8页
• 分类号: R73

摘要

For a given graph G, a k-role assignment of G is a surjective function ?such that , where N(x) and N(y) are the neighborhoods of x and y, respectively. Furthermore, as we limit the number of different roles in the neighborhood of an individual, we call r a restricted size k-role assignment. When the hausdorff distance between the sets of roles assigned to their neighbors is at most 1, we call r a k-threshold close role assignment. In this paper we study the graphs that have k-role assignments, restricted size k-role assignments and k-threshold close role assignments, respectively. By the end we discuss the maximal and minimal graphs which have k-role assignments.