COMPUTING THE EIGENVALUES OF CAYLEY GRAPHS OF ORDER p2q
(ندگان)پدیدآور
Ghorbani, M.Seyyed-Hadi, A.Nowroozi-Larki, F.نوع مدرک
TextOriginal Manuscript
زبان مدرک
Englishچکیده
A graph is called symmetric if its full automorphism group acts transitively on the set of arcs. The Cayley graph $Gamma=Cay(G,S)$ on group $G$ is said to be normal symmetric if $N_A(R(G))=R(G)rtimes Aut(G,S)$ acts transitively on the set of arcs of $Gamma$. In this paper, we classify all connected tetravalent normal symmetric Cayley graphs of order $p^2q$ where $p>q$ are prime numbers.
کلید واژگان
symmetric graphCayley graph
normal graph
arc-transitive graph
شماره نشریه
2تاریخ نشر
2020-01-011398-10-11
ناشر
Shahrood University of Technologyسازمان پدید آورنده
Department of Mathematics, Faculty of Science, Shahid Rajaee Teacher Training University, Tehran, 16785-136, I. R. Iran.Department of Mathematics, Faculty of Science, Shahid Rajaee Teacher Training University, Tehran, 16785-136, I. R. Iran.
Department of Mathematics, Faculty of Science, Shahid Rajaee Teacher Training University, Tehran, 16785-136, I. R. Iran.
شاپا
2345-51282345-511X
Related items
Showing items related by title, author, creator and subject.
-
$Z_k$-Magic Labeling of Some Families of Graphs
Jeyanthi, P.؛ Jeyadaisy, K. (University of Tehran, 2018-12-01)For any non-trivial abelian group A under addition a graph $G$ is said to be $A$-textit{magic} if there exists a labeling $f:E(G) rightarrow A-{0}$ such that, the vertex labeling $f^+$ defined as $f^+(v) = sum f(uv)$ ...
-
Graphs with smallest forgotten index
Gutman, Ivan؛ Ghalavand, Ali؛ Dehghan-Zadeh, T.؛ Ashrafi, Ali Reza (University of Kashan, 2017-09-01)The forgotten topological index of a molecular graph $G$ is defined as $F(G)=sum_{vin V(G)}d^{3}(v)$, where $d(u)$ denotes the degree of vertex $u$ in $G$. The first through the sixth smallest forgotten indices among all ...
-
Note on degree Kirchhoff index of graphs
Hakimi-Nezhaad, Mardjan؛ Ashrafi, Ali Reza؛ Gutman, Ivan (University of Isfahan, 2013-09-01)The degree Kirchhoff index of a connected graph $G$ is defined as the sum of the terms $d_i,d_j,r_{ij}$ over all pairs of vertices, where $d_i$ is the degree of the $i$-th vertex, and $r_{ij}$ the resistance distance ...




