scholarly journals Integral Circulant Ramanujan Graphs of Prime Power Order

10.37236/3159 ◽  
2013 ◽  
Vol 20 (3) ◽  
Author(s):  
T. A. Le ◽  
J. W. Sander
Keyword(s):  
Regular Graph ◽  
Prime Power ◽  
Cayley Graphs ◽  
Complete List ◽  
Prime Power Order ◽  
Circulant Graphs ◽  
Largest Eigenvalue ◽  
Ramanujan Graphs ◽  
Vertex Set

A connected $\rho$-regular graph $G$ has largest eigenvalue $\rho$ in modulus. $G$ is called Ramanujan if it has at least $3$ vertices and the second largest modulus of its eigenvalues is at most $2\sqrt{\rho-1}$. In 2010 Droll classified all Ramanujan unitary Cayley graphs. These graphs of type ${\rm ICG}(n,\{1\})$ form a subset of the class of integral circulant graphs ${\rm ICG}(n,{\cal D})$, which can be characterised by their order $n$ and a set $\cal D$ of positive divisors of $n$ in such a way that they have vertex set $\mathbb{Z}/n\mathbb{Z}$ and edge set $\{(a,b):\, a,b\in\mathbb{Z}/n\mathbb{Z} ,\, \gcd(a-b,n)\in {\cal D}\}$. We extend Droll's result by drawing up a complete list of all graphs ${\rm ICG}(p^s,{\cal D})$ having the Ramanujan property for each prime power $p^s$ and arbitrary divisor set ${\cal D}$.  

scholarly journals The energy of integral circulant graphs with prime power order

2011 ◽  
Vol 5 (1) ◽  
pp. 22-36 ◽  
Author(s):  
J.W. Sander ◽  
T. Sander
Keyword(s):  
Adjacency Matrix ◽  
Prime Power ◽  
Prime Power Order ◽  
Circulant Graph ◽  
Closed Formula ◽  
Circulant Graphs ◽  
Vertex Set

The energy of a graph is the sum of the moduli of the eigenvalues of its adjacency matrix. We study the energy of integral circulant graphs, also called gcd graphs. Such a graph can be characterized by its vertex count n and a set D of divisors of n such that its vertex set is Zn and its edge set is {{a,b} : a, b ? Zn; gcd(a-b, n)? D}. For an integral circulant graph on ps vertices, where p is a prime, we derive a closed formula for its energy in terms of n and D. Moreover, we study minimal and maximal energies for fixed ps and varying divisor sets D.

scholarly journals Automorphisms of Cayley graphs of metacyclic groups of prime-power order

2001 ◽  
Vol 71 (2) ◽  
pp. 223-232 ◽  
Author(s):  
Caiheng Li ◽  
Hyo-Seob Sim
Keyword(s):  
Graph Theory ◽  
Cayley Graph ◽  
Prime Power ◽  
Automorphism Groups ◽  
Cayley Graphs ◽  
Prime Power Order ◽  
Subsequent Work ◽  
Metacyclic Groups

AbstractThis paper inverstigates the automorphism groups of Cayley graphs of metracyclicp-gorups. A characterization is given of the automorphism groups of Cayley grahs of a metacyclicp-group for odd primep. In particular, a complete determiniation of the automophism group of a connected Cayley graph with valency less than 2pof a nonabelian metacyclicp-group is obtained as a consequence. In subsequent work, the result of this paper has been applied to solve several problems in graph theory.

CAYLEY GRAPHS OVER A FINITE CHAIN RING AND GCD-GRAPHS

2016 ◽  
Vol 93 (3) ◽  
pp. 353-363 ◽  
Author(s):  
BORWORN SUNTORNPOCH ◽  
YOTSANAN MEEMARK
Keyword(s):  
Graph Theory ◽  
Prime Power ◽  
Quotient Ring ◽  
Spectral Graph Theory ◽  
Prime Power Order ◽  
Finite Chain ◽  
Circulant Graphs ◽  
Chain Ring ◽  
Finite Chain Ring ◽  
Spectral Graph

We extend spectral graph theory from the integral circulant graphs with prime power order to a Cayley graph over a finite chain ring and determine the spectrum and energy of such graphs. Moreover, we apply the results to obtain the energy of some gcd-graphs on a quotient ring of a unique factorisation domain.

scholarly journals NONEXISTENCE OF A CIRCULANT EXPANDER FAMILY

2010 ◽  
Vol 83 (1) ◽  
pp. 87-95
Author(s):  
KA HIN LEUNG ◽  
VINH NGUYEN ◽  
WASIN SO
Keyword(s):  
Regular Graph ◽  
Elementary Proof ◽  
Explicit Construction ◽  
Simple Graph ◽  
Regular Graphs ◽  
Circulant Graph ◽  
Circulant Graphs ◽  
Largest Eigenvalue ◽  
Image Position ◽  
Second Largest Eigenvalue

AbstractThe expansion constant of a simple graph G of order n is defined as where $E(S, \overline {S})$ denotes the set of edges in G between the vertex subset S and its complement $\overline {S}$. An expander family is a sequence {Gi} of d-regular graphs of increasing order such that h(Gi)>ϵ for some fixed ϵ>0. Existence of such families is known in the literature, but explicit construction is nontrivial. A folklore theorem states that there is no expander family of circulant graphs only. In this note, we provide an elementary proof of this fact by first estimating the second largest eigenvalue of a circulant graph, and then employing Cheeger’s inequalities where G is a d-regular graph and λ2(G) denotes the second largest eigenvalue of G. Moreover, the associated equality cases are discussed.

scholarly journals A Prolific Construction of Strongly Regular Graphs with the $n$-e.c. Property

10.37236/1647 ◽  
2002 ◽  
Vol 9 (1) ◽  
Author(s):  
Peter J. Cameron ◽  
Dudley Stark
Keyword(s):  
Regular Graph ◽  
Prime Power ◽  
Probabilistic Methods ◽  
Strongly Regular Graphs ◽  
Regular Graphs ◽  
Existentially Closed ◽  
Large N ◽  
Vertex Set ◽  
Strongly Regular ◽  
Hadamard Designs

A graph is $n$-e.c.$\,$ ($n$-existentially closed) if for every pair of subsets $U$, $W$ of the vertex set $V$ of the graph such that $U\cap W=\emptyset$ and $|U|+|W|=n$, there is a vertex $v\in V-(U\cup W)$ such that all edges between $v$ and $U$ are present and no edges between $v$ and $W$ are present. A graph is strongly regular if it is a regular graph such that the number of vertices mutually adjacent to a pair of vertices $v_1,v_2\in V$ depends only on whether or not $\{v_1,v_2\}$ is an edge in the graph. The only strongly regular graphs that are known to be $n$-e.c. for large $n$ are the Paley graphs. Recently D. G. Fon-Der-Flaass has found prolific constructions of strongly regular graphs using affine designs. He notes that some of these constructions were also studied by Wallis. By taking the affine designs to be Hadamard designs obtained from Paley tournaments, we use probabilistic methods to show that many non-isomorphic strongly regular $n$-e.c. graphs of order $(q+1)^2$ exist whenever $q\geq 16 n^2 2^{2n}$ is a prime power such that $q\equiv 3\!\!\!\pmod{4}$.

scholarly journals Cycle partitions of regular graphs

2020 ◽  
pp. 1-24
Author(s):  
Vytautas Gruslys ◽  
Shoham Letzter
Keyword(s):  
Regular Graph ◽  
Bipartite Graphs ◽  
Disjoint Paths ◽  
Regular Graphs ◽  
Simple Construction ◽  
Vertex Set ◽  
Almost All ◽  
Vertex Disjoint

Abstract Magnant and Martin conjectured that the vertex set of any d-regular graph G on n vertices can be partitioned into $n / (d+1)$ paths (there exists a simple construction showing that this bound would be best possible). We prove this conjecture when $d = \Omega(n)$ , improving a result of Han, who showed that in this range almost all vertices of G can be covered by $n / (d+1) + 1$ vertex-disjoint paths. In fact our proof gives a partition of V(G) into cycles. We also show that, if $d = \Omega(n)$ and G is bipartite, then V(G) can be partitioned into n/(2d) paths (this bound is tight for bipartite graphs).

Space groups and groups of prime-power order II

1980 ◽  
Vol 35 (1) ◽  
pp. 203-209 ◽  
Author(s):  
H. Finken ◽  
J. Neub�ser ◽  
W. Plesken
Keyword(s):  
Prime Power ◽  
Prime Power Order ◽  
Space Groups

On S-Quasinormal and C-Normal Subgroups of Prime Power Order in Finite Groups

2011 ◽  
Vol 18 (04) ◽  
pp. 685-692
Author(s):  
Xuanli He ◽  
Shirong Li ◽  
Xiaochun Liu
Keyword(s):  
Finite Group ◽  
Finite Groups ◽  
Prime Power ◽  
Maximal Subgroups ◽  
Prime Power Order ◽  
Normal Subgroups ◽  
A Finite Group

Let G be a finite group, p the smallest prime dividing the order of G, and P a Sylow p-subgroup of G with the smallest generator number d. Consider a set [Formula: see text] of maximal subgroups of P such that [Formula: see text]. It is shown that if every member [Formula: see text] of is either S-quasinormally embedded or C-normal in G, then G is p-nilpotent. As its applications, some further results are obtained.

Sign in / Sign up

Export Citation Format

Share Document