Related papers: The 4-Regular Edge-Transitive Graphs of Girth 4
We study perfect state transfer in Kendon's model of discrete quantum walks. In particular, we give a characterization of perfect state transfer purely in terms of the graph spectra, and construct an infinite family of $4$-regular circulant…
We study a generalization of strongly regular graphs. We call a graph strongly walk-regular if there is an $\ell >1$ such that the number of walks of length $\ell$ from a vertex to another vertex depends only on whether the two vertices are…
A non-complete graph is \emph{$2$-distance-transitive} if, for $i=1,2$ and for any two vertex pairs $(u_1,v_1)$ and $(u_2,v_2)$ with the same distance $i$ in the graph, there exists an element of the graph automorphism group that maps…
We prove that every finite arc-transitive graph of valency twice a prime admits a nontrivial semiregular automorphism, that is, a non-identity automorphism whose cycles all have the same length. This is a special case of the Polycirculant…
Let $S$ be a set of transpositions generating the symmetric group $S_n$. The transposition graph of $S$ is defined to be the graph with vertex set $\{1,\ldots,n\}$, and with vertices $i$ and $j$ being adjacent in $T(S)$ whenever $(i,j) \in…
The family $\mathcal{OG}(4)$ consisting of graph-group pairs $(\Gamma, G)$, where $\Gamma$ is a finite, connected, 4-valent graph admitting a $G$-vertex-, and $G$-edge-transitive, but not $G$-arc-transitive action, has recently been…
In this note we construct a new infinite family of $(q-1)$-regular graphs of girth $8$ and order $2q(q-1)^2$ for all prime powers $q\ge 16$, which are the smallest known so far whenever $q-1$ is not a prime power or a prime power plus one…
We investigate the structure of conformally rigid graphs. Graphs are conformally rigid if introducing edge weights cannot increase (decrease) the second (last) eigenvalue of the Graph Laplacian. Edge-transitive graphs and distance-regular…
A graph is said to be a bi-Cayley graph over a group H if it admits H as a group of automorphisms acting semiregularly on its vertices with two orbits. For a prime p, we call a bi-Cayley graph over a metacyclic p-group a bi-p-metacirculant.…
Let $G$ be a simple graph with $n\geq4$ vertices and $d(x)+d(y)\geq n+k$ for each edge $xy\in E(G)$. In this work we prove that $G$ either contains a spanning closed trail containing any given edge set $X$ if $|X|\leq k$, or $G$ is a well…
We prove that, if $\Gamma$ is a finite connected cubic vertex-transitive graph, then either there exists a semiregular automorphism of $\Gamma$ of order at least $6$, or the number of vertices of $\Gamma$ is bounded above by an absolute…
We propose a Law of Nature? Viz., Pure Regularity Occurs at Na\"ive Levels and Regularity has Affinity with Evenness. In a series of three papers, it was established that regular Euler graphs with only one type of (pure) cycles are…
In this paper we construct all strongly regular graphs, with at most 600 vertices, admitting a transitive action of the orthogonal group $O^+(6,2)$ or $O^-(6,2)$. Consequently, we prove the existence of strongly regular graphs with…
In this dissertation, we explore the structure of inversion graphs of permutations--a class of graphs that naturally arises by representing each permutation as a graph, where vertices correspond to entries and edges encode inversions.…
Let $G$ be the circulant graph $C_n(S)$ with $S \subseteq \{1, 2, \dots, \lfloor \frac{n}{2} \rfloor\}$, and let $I(G)$ denote the edge ideal in the polynomial ring $R=\mathbb{K}[x_0, x_1, \dots, x_{n-1}]$ over a field $\mathbb{K}$. In this…
We study the topology of the lcm-lattice of edge ideals and derive upper bounds on the Castelnuovo-Mumford regularity of the ideals. In this context it is natural to restrict to the family of graphs with no induced 4-cycle in their…
A graph is said to be globally rigid in $d$-dimensional space if almost all of its embeddings are unique up to isometries. If a graph has enough automorphisms to send any of its vertices into any other, then it is called vertex-transitive.…
A graph $\Gamma$ is called edge-regular whenever it is regular and for any two adjacent vertices, the number of their common neighbors is independent of the choice of vertices. A clique $C$ in $\Gamma$ is called regular whenever for any…
A strong edge coloring of a graph is a proper edge coloring where the edges at distance at most two receive distinct colors. It is known that every planar graph with maximum degree D has a strong edge coloring with at most 4D + 4 colors. We…
Threshold graphs are a prevalent and widely studied class of simple graphs. They have several equivalent definitions which makes them a go-to class for finding examples and counter examples when testing and learning. This versatility has…