نتایج جستجو برای: integral cayley graph
تعداد نتایج: 312504 فیلتر نتایج به سال:
The symmetry properties of mathematical structures are often important for understanding these structures. Graphs sometimes have a large group of symmetries, especially when they have an algebraic construction such as the Cayley graphs. These graphs are constructed from abstract groups and are vertex-transitive and this is the reason for their symmetric appearance. Some Cayley graphs have even ...
a recursive-circulant $g(n; d)$ is defined to be acirculant graph with $n$ vertices and jumps of powers of $d$.$g(n; d)$ is vertex-transitive, and has some strong hamiltonianproperties. $g(n; d)$ has a recursive structure when $n = cd^m$,$1 leq c < d $ [10]. in this paper, we will find the automorphismgroup of some classes of recursive-circulant graphs. in particular, wewill find that the autom...
We propose the theory of Cayley graphs as a framework to analyse gate counts and quantum costs resulting from reversible circuit synthesis. Several methods have been proposed in the reversible logic synthesis literature by considering different libraries whose gates are associated to the generating sets of certain Cayley graphs. In a Cayley graph, the distance between two vertices corresponds t...
In this paper, we study matching integral graphs of small order. A graph is called matching integral if the zeros of its matching polynomial are all integers. Matching integral graphs were first studied by Akbari, Khalashi, etc. They characterized all traceable graphs which are matching integral. They studied matching integral regular graphs. Furthermore, it has been shown that there is no matc...
Although (G, dS) is not a geodesic metric space, its Cayley graph ΓS(G) is, and it is the geodesics that provide the natural relationship between dS and the Cayley graph. Let G be the vertex set on the Cayley graph. Two vertices g and h are adjacent in ΓS(G) precisely when g −1h ∈ S or h−1g ∈ S, in which case dS(g, h) = 1. Inductively, it follows that dS(g, h) = n precisely when the shortest pa...
The unitary Cayley graph on n vertices, Xn, has vertex set Z nZ , and two vertices a and b are connected by an edge if and only if they differ by a multiplicative unit modulo n, i.e. gcd(a− b, n) = 1. A k-regular graph X is Ramanujan if and only if λ(X) 6 2 √ k − 1 where λ(X) is the second largest absolute value of the eigenvalues of the adjacency matrix of X. We obtain a complete characterizat...
Let $Gamma$ be a graph with adjacency eigenvalues $lambda_1leqlambda_2leqldotsleqlambda_n$. Then the energy of $Gamma$, a concept defined in 1978 by Gutman, is defined as $mathcal{E}(G)=sum_{i=1}^n|lambda_i|$. Also the Estrada index of $Gamma$, which is defined in 2000 by Ernesto Estrada, is defined as $EE(Gamma)=sum_{i=1}^ne^{lambda_i}$. In this paper, we compute the eigen...
we investigate two constructions - the replacement and the zig-zag product of graphs - describing several fascinating connections with combinatorics, via the notion of expander graph, group theory, via the notion of semidirect product and cayley graph, and with markov chains, via the lamplighter random walk. many examples are provided.
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید