UNIT AND UNITARY CAYLEY GRAPHS FOR THE RING OF EISENSTEIN INTEGERS MODULO \(n\)

Let \({E}_{n}\) be the ring of Eisenstein integers modulo \(n\). We denote by \(G({E}_{n})\) and \(G_{{E}_{n}}\), the unit graph and the unitary Cayley graph of \({E}_{n}\), respectively. In this paper, we obtain the value of the diameter, the girth, the clique number and the chromatic number of these graphs. We also prove that for each \(n>1\), the graphs \(G(E_{n})\) and \(G_{E_{n}}\) are Hamiltonian.

Integral Mixed Cayley Graphs over Abelian Groups

A mixed graph is said to be integral if all the eigenvalues of its Hermitian adjacency matrix are integer. Let $\Gamma$ be an abelian group. The mixed Cayley graph $Cay(\Gamma,S)$ is a mixed graph on the vertex set $\Gamma$ and edge set $\left\{ (a,b): b-a\in S \right\}$, where $0\not\in S$. We characterize integral mixed Cayley graph $Cay(\Gamma,S)$ over an abelian group $\Gamma$ in terms of its connection set $S$.

The structure of Cayley graphs of dihedral groups of Valencies 1, 2 and 3

Let G be a group and S be a subset of G such that e ∉ S and S−1 ⊆ S. Then Cay(G, S) is a simple undirected Cayley graph whose vertices are all elements of G and two vertices x and y are adjacent if and only if xy−1 ∈ S. The size of subset S is called the valency of Cay(G, S). In this paper, we determined the structure of all Cay(D2n, S), where D2n is a dihedral group of order 2n, n ≥ 3 and |S| = 1, 2 or 3.

A 2-arc Transitive Hexavalent Nonnormal Cayley Graph on A119

A Cayley graph Γ=Cay(G,S) is said to be normal if the base group G is normal in AutΓ. The concept of the normality of Cayley graphs was first proposed by M.Y. Xu in 1998 and it plays a vital role in determining the full automorphism groups of Cayley graphs. In this paper, we construct an example of a 2-arc transitive hexavalent nonnormal Cayley graph on the alternating group A119. Furthermore, we determine the full automorphism group of this graph and show that it is isomorphic to A120.

the Graph point – symmetric

Cayley graph has been introduced by A . Cayley , which is point – symmetric . However in this paper , I have found another type of symmetric graph , which is not Cayley graph . This graph is called peterson graph with 10 vertices is proposed

A Cayley graph for F2 × F2 which is not minimally almost convex

We give an example of a Cayley graph [Formula: see text] for the group [Formula: see text] which is not minimally almost convex (MAC). On the other hand, the standard Cayley graph for [Formula: see text] does satisfy the falsification by fellow traveler property (FFTP), which is strictly stronger. As a result, any Cayley graph property [Formula: see text] lying between FFTP and MAC (i.e., [Formula: see text]) is dependent on the generating set. This includes the well-known properties FFTP and almost convexity, which were already known to depend on the generating set as well as Poénaru’s condition [Formula: see text] and the basepoint loop shortening property (LSP) for which dependence on the generating set was previously unknown. We also show that the Cayley graph [Formula: see text] does not have the LSP, so this property also depends on the generating set.

Some properties of subgroup complementary addition Cayley graphs on abelian groups

In this paper, we introduce subgroup complementary addition Cayley graph [Formula: see text] and compute its graph invariants. Also, we prove that [Formula: see text] if and only if [Formula: see text] for all [Formula: see text] where [Formula: see text].

The (E)FTSM-(edge) Connectivity of Cayley Graphs Generated by Transposition Trees

The Cayley graph generated by a transposition tree [Formula: see text] is a class of Cayley graphs that contains the star graph and the bubble sort graph. A graph [Formula: see text] is called strongly Menger (SM for short) (edge) connected if each pair of vertices [Formula: see text] are connected by [Formula: see text] (edge)-disjoint paths, where [Formula: see text] are the degree of [Formula: see text] and [Formula: see text] respectively. In this paper, the maximally edge-fault-tolerant and the maximally vertex-fault-tolerant of [Formula: see text] with respect to the SM-property are found and thus generalize or improve the results in [19, 20, 22, 26] on this topic.

Logarithmic diameter bounds for some Cayley graphs

Let S ⊂ GL n ⁢ ( Z ) S\subset\mathrm{GL}_{n}(\mathbb{Z}) be a finite symmetric set. We show that if the Zariski closure of Γ = ⟨ S ⟩ \Gamma=\langle S\rangle is a product of special linear groups or a special affine linear group, then the diameter of the Cayley graph Cay ⁡ ( Γ / Γ ⁢ ( q ) , π q ⁢ ( S ) ) \operatorname{Cay}(\Gamma/\Gamma(q),\pi_{q}(S)) is O ⁢ ( log ⁡ q ) O(\log q) , where 𝑞 is an arbitrary positive integer, π q : Γ → Γ / Γ ⁢ ( q ) \pi_{q}\colon\Gamma\to\Gamma/\Gamma(q) is the canonical projection induced by the reduction modulo 𝑞, and the implied constant depends only on 𝑆.