Title of article
Weakly image-arc transitive graphs
Author/Authors
Hongming Yan، نويسنده , , Suohai Fan، نويسنده ,
Issue Information
روزنامه با شماره پیاپی سال 2008
Pages
4
From page
2643
To page
2646
Abstract
Weakly s-arc transitive graphs are introduced and determined. A graph is said to be weakly s-arc transitive if its endomorphism monoid acts transitively on the set of s-arcs. The main results are: (1) A nonbipartite graph is weakly s-arc transitive if and only if it is s-arc transitive. (2) A tree with diameter
Keywords
Weakly ss-arc transitive , Endomorphism , Girth , Retract , Core
Journal title
Discrete Mathematics
Serial Year
2008
Journal title
Discrete Mathematics
Record number
947361
Link To Document