Almost every graph has a fixed edge

被引：1
|
作者：
Fan, HB [1 ]
机构：
[1] Shandong Univ, Dept Math, Jinan 250100, Peoples R China
来源：
CHINESE SCIENCE BULLETIN | 1998年 / 43卷 / 02期
基金：
中国国家自然科学基金;
关键词：
graph; isomorphism; automorphism group; fixed edge;
D O I：
10.1007/BF02883915
中图分类号：
O [数理科学和化学]; P [天文学、地球科学]; Q [生物科学]; N [自然科学总论];
学科分类号：
07 ; 0710 ; 09 ;
摘要：
An edge e of a graph G is called a fixed edge ii G - e + e' congruent to G implies e' = e, and an isomorphic fixed edge if G - e + e' congruent to G implies that there exists an automorphism of G - e, which maps the ends of e to the ends of e'. I: is proved that almost every graph is with all its edges as fixed edges and isomorphic fixed edges, and it is conjectured that all graphs contain isomorphic fixed edges.
引用
收藏
页码：99 / 101
页数：3
相关论文
共 50 条
12345