Almost every graph has a fixed edge

作     者：FAN Hongbing Department of Mathematics, Shandong University, Jinan 250100, China 

作者机构：Department of Mathematics Shandong University Jinan China 

出 版 物：《Chinese Science Bulletin》 (科学通报(英文版))

年 卷 期：1998年第43卷第2期

页      面：99-101页

核心收录：

学科分类：07[理学] 070104[理学-应用数学] 0701[理学-数学] 

基　　金：National Natural Science Foundation of China NSFC: 79790130 

主　　题：graph isomorphism automorphism group fixed edge. 

摘      要：An edge e of a graph G is called a fixed edge if G-e+e′ G implies e′=e, and an isomorphic fixed edge if G-e+e′ G implies that there exists an automorphism of G-e, which maps the ends of e to the ends of e′. It 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.