scholarly journals A Generalized Alon-Boppana Bound and Weak Ramanujan Graphs

10.37236/5933 ◽  
2016 ◽  
Vol 23 (3) ◽  
Author(s):  
Fan Chung
Keyword(s):  
Regular Graphs ◽  
Ramanujan Graphs ◽  
Eigenvalue Bound ◽  
Vertex Set ◽  
Eigenvalues Of Graphs

A basic eigenvalue bound due to Alon and Boppana holds only for regular graphs. In this paper we give a generalized Alon-Boppana bound for eigenvalues of graphs that are not required to be regular. We show that a graph $G$ with diameter $k$ and vertex set $V$, the smallest nontrivial eigenvalue $\lambda_1$ of the normalized Laplacian $\mathcal L$ satisfies$$ \lambda_1 \leq 1-\sigma \big(1- \frac c {k} \big)$$ for some constant $c$ where $\sigma = 2\sum_v d_v \sqrt{d_v-1}/\sum_v d_v^2 $ and $d_v$ denotes the degree of the vertex $v$.We consider weak Ramanujan graphs defined as graphs satisfying $ \lambda_1 \geq 1-\sigma$. We examine the vertex expansion and edge expansion of weak Ramanujan graphs and then use the expansion properties among other methods to derive the above Alon-Boppana bound. A corrigendum was added on the 3rd of November 2017.

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).

Random flights on regular graphs

1984 ◽  
Vol 16 (03) ◽  
pp. 618-637 ◽  
Author(s):  
Lajos Takács
Keyword(s):  
Automorphism Group ◽  
Transition Probabilities ◽  
Finite Graph ◽  
Initial Position ◽  
Regular Graphs ◽  
Random Flights ◽  
The Past ◽  
Initial Location ◽  
Vertex Set

Let K be a finite graph with vertex set V = {x 0, x 1, …, xσ –1} and automorphism group G. It is assumed that G acts transitively on V. We can imagine that the vertices of K represent σ cities and a traveler visits the cities in a series of random flights. The traveler starts at a given city and in each flight, independently of the past journey, chooses a city at random as the destination. Denote by vn (n = 1, 2, …) the location of the traveler at the end of the nth flight, and by v 0 the initial location. It is assumed that the transition probabilities P{vn = xj | vn –1 = xi }, xi ϵ V, xj ϵ V, do not depend on n and are invariant under the action of G on V. The main result of this paper consists in determining p(n), the probability that the traveler returns to the initial position at the end of the nth flight.

Perfect 1-factorizations

2019 ◽  
Vol 69 (3) ◽  
pp. 479-496 ◽  
Author(s):  
Alexander Rosa
Keyword(s):  
Pairwise Disjoint ◽  
Hamiltonian Cycle ◽  
Perfect Matching ◽  
Complete Graphs ◽  
Regular Graphs ◽  
Cubic Graphs ◽  
Vertex Set ◽  
Early Survey

AbstractLetGbe a graph with vertex-setV=V(G) and edge-setE=E(G). A 1-factorofG(also calledperfect matching) is a factor ofGof degree 1, that is, a set of pairwise disjoint edges which partitionsV. A 1-factorizationofGis a partition of its edge-setEinto 1-factors. For a graphGto have a 1-factor, |V(G)| must be even, and for a graphGto admit a 1-factorization,Gmust be regular of degreer, 1 ≤r≤ |V| − 1.One can find in the literature at least two extensive surveys [69] and [89] and also a whole book [90] devoted to 1-factorizations of (mainly) complete graphs.A 1-factorization ofGis said to beperfectif the union of any two of its distinct 1-factors is a Hamiltonian cycle ofG. An early survey on perfect 1-factorizations (abbreviated as P1F) of complete graphs is [83]. In the book [90] a whole chapter (Chapter 16) is devoted to perfect 1-factorizations of complete graphs.It is the purpose of this article to present what is known to-date on P1Fs, not only of complete graphs but also of other regular graphs, primarily cubic graphs.

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 VERTEX DISTANCE COMPLEMENT SPECTRUM OF SUBDIVISION VERTEX JOIN AND SUBDIVISION EDGE JOIN OF TWO REGULAR GRAPHS

2021 ◽  
Vol 7 (1) ◽  
pp. 102
Author(s):  
Ann Susa Thomas ◽  
Sunny Joseph Kalayathankal ◽  
Joseph Varghese Kureethara
Keyword(s):  
Connected Graph ◽  
Symmetric Matrix ◽  
Regular Graphs ◽  
Real Symmetric Matrix ◽  
Adjacency Spectrum ◽  
Vertex Set

The vertex distance complement (VDC) matrix \(\textit{C}\), of a connected graph  \(G\) with vertex set consisting of \(n\) vertices, is a real symmetric matrix \([c_{ij}]\) that takes the value \(n - d_{ij}\) where \(d_{ij}\) is the distance between the vertices \(v_i\) and \(v_j\) of \(G\) for \(i \neq j\) and 0 otherwise. The vertex distance complement spectrum of the subdivision vertex join, \(G_1 \dot{\bigvee} G_2\) and the subdivision edge join \(G_1 \underline{\bigvee} G_2\) of regular graphs \(G_1\) and \(G_2\)  in terms of the adjacency spectrum are determined in this paper.

Codes from incidence matrices of some regular graphs

2020 ◽  
pp. 2150035
Author(s):  
R. Saranya ◽  
C. Durairajan
Keyword(s):  
Linear Codes ◽  
Automorphism Groups ◽  
Regular Graphs ◽  
Permutation Decoding ◽  
Incidence Matrices ◽  
Hamming Metric ◽  
Vertex Set ◽  
Lee Distance ◽  
Lee Metric ◽  
Transitive Subgroup

We examine the [Formula: see text]-ary linear codes with respect to Lee metric from incidence matrix of the Lee graph with vertex set [Formula: see text] and two vertices being adjacent if their Lee distance is one. All the main parameters of the codes are obtained as [Formula: see text] if [Formula: see text] is odd and [Formula: see text] if [Formula: see text] is even. We examine also the [Formula: see text]-ary linear codes with respect to Hamming metric from incidence matrices of Desargues graph, Pappus graph, Folkman graph and the main parameters of the codes are [Formula: see text], respectively. Any transitive subgroup of automorphism groups of these graphs can be used for full permutation decoding using the corresponding codes. All the above codes can be used for full error correction by permutation decoding.

scholarly journals Binary Representations of Regular Graphs

2011 ◽  
Vol 2011 ◽  
pp. 1-15
Author(s):  
Yury J. Ionin
Keyword(s):  
Regular Graph ◽  
Line Graph ◽  
Strongly Regular Graph ◽  
Regular Graphs ◽  
Spherical Representation ◽  
Least Eigenvalue ◽  
Vertex Set ◽  
Strongly Regular ◽  
Distance Set ◽  
Hamming Space

For any 2-distance set in the n-dimensional binary Hamming space , let be the graph with as the vertex set and with two vertices adjacent if and only if the distance between them is the smaller of the two nonzero distances in . The binary spherical representation number of a graph , or bsr(), is the least n such that is isomorphic to , where is a 2-distance set lying on a sphere in . It is shown that if is a connected regular graph, then bsr, where b is the order of and m is the multiplicity of the least eigenvalue of , and the case of equality is characterized. In particular, if is a connected strongly regular graph, then bsr if and only if is the block graph of a quasisymmetric 2-design. It is also shown that if a connected regular graph is cospectral with a line graph and has the same binary spherical representation number as this line graph, then it is a line graph.

scholarly journals Rectilinear Monotone r-Regular Planar Graphs for r = {3, 4, 5}

d'CARTESIAN ◽  
2015 ◽  
Vol 4 (1) ◽  
pp. 103
Author(s):  
Arthur Wulur ◽  
Benny Pinontoan ◽  
Mans Mananohas
Keyword(s):  
Planar Graph ◽  
Connected Graph ◽  
Planar Graphs ◽  
Infinite Family ◽  
Regular Graphs ◽  
Vertex Set ◽  
Simple Connected Graph

A graph G consists of non-empty set of vertex/vertices (also called node/nodes) and the set of lines connecting two vertices called edge/edges. The vertex set of a graph G is denoted by V(G) and the edge set is denoted by E(G). A Rectilinear Monotone r-Regular Planar Graph is a simple connected graph that consists of vertices with same degree and horizontal or diagonal straight edges without vertical edges and edges crossing. This research shows that there are infinite family of rectilinear monotone r-regular planar graphs for r = 3and r = 4. For r = 5, there are two drawings of rectilinear monotone r-regular planar graphs with 12 vertices and 16 vertices. Keywords: Monotone Drawings, Planar Graphs, Rectilinear Graphs, Regular Graphs

Eigenpolytopes of Distance Regular Graphs

1998 ◽  
Vol 50 (4) ◽  
pp. 739-755 ◽  
Author(s):  
C. D. Godsil
Keyword(s):  
Convex Hull ◽  
Orthogonal Projection ◽  
Adjacency Matrix ◽  
Gram Matrix ◽  
Regular Graphs ◽  
Largest Eigenvalue ◽  
The Matrix ◽  
Vertex Set ◽  
Distance Regular Graphs ◽  
Second Largest Eigenvalue

AbstractLet X be a graph with vertex set V and let A be its adjacency matrix. If E is the matrix representing orthogonal projection onto an eigenspace of A with dimension m, then E is positive semi-definite. Hence it is the Gram matrix of a set of |V| vectors in Rm. We call the convex hull of a such a set of vectors an eigenpolytope of X. The connection between the properties of this polytope and the graph is strongest when X is distance regular and, in this case, it is most natural to consider the eigenpolytope associated to the second largest eigenvalue of A. The main result of this paper is the characterisation of those distance regular graphs X for which the 1-skeleton of this eigenpolytope is isomorphic to X.

Random flights on regular graphs

1984 ◽  
Vol 16 (3) ◽  
pp. 618-637 ◽  
Author(s):  
Lajos Takács
Keyword(s):  
Automorphism Group ◽  
Transition Probabilities ◽  
Finite Graph ◽  
Initial Position ◽  
Regular Graphs ◽  
Random Flights ◽  
The Past ◽  
Initial Location ◽  
Vertex Set

Let K be a finite graph with vertex set V = {x0, x1, …, xσ–1} and automorphism group G. It is assumed that G acts transitively on V. We can imagine that the vertices of K represent σ cities and a traveler visits the cities in a series of random flights. The traveler starts at a given city and in each flight, independently of the past journey, chooses a city at random as the destination. Denote by vn (n = 1, 2, …) the location of the traveler at the end of the nth flight, and by v0 the initial location. It is assumed that the transition probabilities P{vn = xj | vn–1 = xi}, xi ϵ V, xj ϵ V, do not depend on n and are invariant under the action of G on V. The main result of this paper consists in determining p(n), the probability that the traveler returns to the initial position at the end of the nth flight.

Sign in / Sign up

Export Citation Format

Share Document