| تعداد نشریات | 24 |
| تعداد شمارهها | 859 |
| تعداد مقالات | 7,646 |
| تعداد مشاهده مقاله | 13,577,937 |
| تعداد دریافت فایل اصل مقاله | 11,684,537 |
ADJACENCY AND SHIFT-TRANSITIVITY IN GRAPH PRODUCTS | ||
| Iranian Journal of Science | ||
| مقالات آماده انتشار، پذیرفته شده، انتشار آنلاین از تاریخ 06 فروردین 1395 | ||
| نوع مقاله: Regular Paper | ||
| شناسه دیجیتال (DOI): 10.22099/ijsts.2016.3640 | ||
| نویسنده | ||
| Mohamad A. Iranmanesh* | ||
| Yazd University | ||
| چکیده | ||
| Let $Gamma$ be a finite simple graph with automorphism group $Aut(Gamma).$ An automorphism $sigma$ of $Gamma$ is said to be an adjacency automorphism, if for every vertex $xin V(Gamma)$, either $sigma x=x$ or $sigma x$ is adjacent to $x$ in $Gamma$. A shift is an adjacency automorphism fixing no vertices. The graph $Gamma$ is (shift) adjacency-transitive if for every pair of vertices $x, x'in V(Gamma)$, there exists a sequence of (shift) adjacency automorphisms $sigma_{1},sigma_{2},...sigma_{k}inAut(Gamma)$ such that $sigma_{1}sigma_{2}...sigma_{k}x=x'$. If, in addition, for every pair of adjacent vertices $x, x'in V(Gamma)$ there exists an (shift) adjacency automorphism say $sigmain Aut(Gamma)$ sending $x$ to $x'$, then $Gamma$ is strongly (shift) adjacency-transitive. If for every pair of adjacent vertices $x, x'in V(Gamma)$ there exists exactly one shift $sigmainAut(Gamma)$ sending $x$ to $x'$, then $Gamma$ is uniquely shift-transitive. In this paper, we investigate these concepts in some standard graph products. | ||
| کلیدواژهها | ||
| Vertex-transitive graph؛ Adjacency-transitive graph؛ Shift-transitive graph؛ Lexicographic product؛ Strong product | ||
|
آمار تعداد مشاهده مقاله: 921 |
||