Constructive graph labeling using double cosets.
Discrete Mathematics(1974)
摘要
In this paper we consider the following labeling problem: Given a graph G with n nodes and symmetry group @? and a set @? of n not necessarily distinct labels, construct all distinct, with respect to @?, labelings of the nodes of G with the elements of @?. Two efficient computer implemented algorithms for explicitly constructing such labelings are presented. These algorithms are based on a group theoretic formulation of the graph labeling problem.
更多查看译文
AI 理解论文
溯源树
样例
生成溯源树,研究论文发展脉络