Graph conditions are very important for graph transformation systems and graph programs in a large variety of application areas. Nevertheless, non-local graph properties like “there exists a path”, “the graph is connected”, and “the graph is cycle-free” are not expressible by finite graph conditions. In this paper, we generalize the notion of finite graph conditions, expressively equivalent to ...

A graph is textit{symmetric}, if its automorphism group is transitive on the set of its arcs. In this paper, we  classifyall the connected cubic symmetric  graphs of order $36p$  and $36p^{2}$, for each prime $p$, of which the proof depends on the classification of finite simple groups.

We call a Clayey graph Γ = Cay(G, S) normal for G, if the right regular representation R(G) of G is normal in the full automorphism group of Aunt(Γ). in this paper, we give a classification of all non-normal Clayey graphs of finite abelian group with valency 6. 

in this work, using eigenvalues and eigenvectors of unitary cayley graphs over finite local rings and elementary linear algebra, we characterize which local rings allowing pst occurring in its unitary cayley graph. moreover, we have some developments when $r$ is a product of local rings.

We prove that a lamplighter graph of a locally finite graph over a finite graph does not admit a non-constant harmonic function of finite Dirichlet energy.

Abstract : We call a Cayley graph Γ = Cay (G, S) normal for G, if the right regular representation R(G) of G is normal in the full automorphism group of Aut(Γ). In this paper, a classification of all non-normal Cayley graphs of finite abelian group with valency 6 was presented.