Bounded homogeneity of finite graphs |
Published date:2014-11-21 Provided by:School of Science |
Title: Bounded homogeneity of finite graphs
Speaker: Dr. ZHOU Jinxin Time: 2014-11-24, 19:30 – 20:30 Location: Conference Room, Academy of Fundamental and Interdisciplinary, the Students’ Activity and Service Center Abstract: Let k be an integer. A finite graph G is said to be k-connected homogeneous if every isomorphism between any two connected induced subgraphs of order at most k extends an automorphism of G. A finite graph G is said to be k-set-homogeneous if for any two isomorphic induced subgraphs A, B of order at most k, there is an automorphism of G taking A to B. A characterization of 3-commected homogeneous graphs is presented and a classification of 2-set homogeneous graphs is given. |