摘要
边对称图〈H,G〉含有子图H和G,使得删去边子集E(H)的所有边后,剩余图的任何分支均同构于G.刻划了一类对称图的基本性质,推广边魔幻全标号到广义边魔幻全标号.利用可算法化的构造性证明,得到大型的具有(广义)边魔幻全标号的对称图.
An edge-symmetric graph （ H, G） contains subgraphs H and G such that the deletion of edges of E（H） results in a disconnected graph in which every component is isomorphic to G. In this paper basic properties of a special class of edge-symmetric graphs are inverstigated, the notion of edge-magic total labelling is generalized to that of generalized edge-magic total labelling, some edgesymmetric graphs with large scale having （generalized） edge-magic total labellings are obtained and proved algorithmically.
出处
《四川师范大学学报（自然科学版）》
CAS
CSCD
北大核心
2013年第1期28-33,共6页
Journal of Sichuan Normal University（Natural Science）
基金
国家自然科学基金(61163054
61163037)资助项目
关键词
树
集合有序标号
边魔幻全标号
边对称图
tree
set-ordered labellings
edge-magic total labelling
edge-symmetric graphs
