相关论文: A proof of the polycirculant conjecture
Given a graph $G$, the graph $[G]$ obtained by adding, for each pair of vertices of $G$, a unique vertex adjacent to both vertices is called the binding graph of $G$. In this work, we show that the class of binding graphs is…
A connected graph $\Gamma=(V,E)$ of valency at least $3$ is called a basic $2$-arc-transitive graph if its full automorphism group has a subgroup $G$ with the following properties: (i) $G$ acts transitively on the set of $2$-arcs of…
A graph G is perfect if for every induced subgraph H, the chromatic number of H equals the size of the largest complete subgraph of H, and G is Berge if no induced subgraph of G is an odd cycle of length at least 5 or the complement of one.…
The girth of a graph is defined as the length of a shortest cycle in the graph. A $(k; g)$-cage is a graph of minimum order among all $k$-regular graphs with girth $g$. A cycle $C$ in a graph $G$ is termed nonseparating if the graph…
Distance-regular graphs have many beautiful combinatorial properties. Distance-transitive graphs have very strong symmetries, and they are distance-regular, i.e. distance-transitivity implies distance-regularity. In this paper, we give…
We show that there is a collection of subgroups of the mapping class group of a surface such that the associated coset intersection complex is quasi-isometric and homotopy equivalent to the curve complex. Moreover, we prove that these two…
Graph dynamical systems (GDSs) can be used to describe a wide range of distributed, nonlinear phenomena. In this paper we characterize cycle equivalence of a class of finite GDSs called sequential dynamical systems SDSs. In general, two…
An alternating cycle in a 2-two-edge-colored graph is a cycle such that any two consecutive edges have different colors. Let $G_1, \ldots, G_k$ be a collection of pairwise vertex disjoint 2-edge-colored graphs. The colored generalized sum…
The Johnson graph $J(n,i)$ is defined to the graph whose vertex set is the set of all $i$-element subsets of $\{1,\ldots,n\}$, and two vertices are joined whenever the cardinality of their intersection is equal to $i-1$. In Ramras and…
Let $G$ be a transitive permutation group on $\Omega$ with two points $\alpha, \beta\in\Omega$ such that $G_{\alpha}\cap G_{\beta}=1$. The Saxl graph $\Sigma(G)$ of the pair $(G,\Omega)$ is the graph with vertex set $\Omega$, while two…
In this paper, we give a lengthy proof of a small result! A graph is bisplit if its vertex set can be partitioned into three stable sets with two of them inducing a complete bipartite graph. We prove that these graphs satisfy the…
Let $G$ be a finite group and let $S$ be an inverse-closed subset of $G$ not containing the identity. The Cayley graph $\mathrm{Cay}(G,S)$ has vertex set $G$, where two vertices $x$ and $y$ are adjacent if and only if $x^{-1}y \in S$.…
The Johnson graph $J(n, i)$ is defined as the graph whose vertex set is the set of all $i$-element subsets of $\{1, . . ., n \}$, and two vertices are adjacent whenever the cardinality of their intersection is equal to $i$-1. In Ramras and…
A permutation graph is a cubic graph admitting a 1-factor M whose complement consists of two chordless cycles. Extending results of Ellingham and of Goldwasser and Zhang, we prove that if e is an edge of M such that every 4-cycle containing…
A $biased\ graph$ is a pair $(G,\mathcal{B})$, where $G$ is a graph and $\mathcal{B}$ is a collection of `balanced' circuits of $G$ such that no $\Theta$-subgraph of $G$ contains precisely two balanced circuits. We prove a Ramsey-type…
In order to complete (and generalize) results of Gardiner and Praeger on 4-valent symmetric graphs (European J. Combin, 15 (1994)) we apply the method of lifting automorphisms in the context of elementary-abelian covering projections. In…
In this paper, we are motivated by the conjectures proposed by C.~Bender \textit{et al.}, \cite{C} in 2024. We have settled the first two conjectures negatively by providing a counter example in \cite{KTJ}, whereas in this paper, we prove…
Circular arc graphs are graphs whose vertices can be represented as arcs on a circle such that any two vertices are adjacent if and only if their corresponding arcs intersect. Proper circular arc graphs are graphs which have a circular arc…
The graph reconstruction conjecture asserts that every finite simple graph on at least three vertices can be reconstructed up to isomorphism from its deck - the collection of its vertex-deleted subgraphs. Kocay's Lemma is an important tool…
When dealing with symmetry properties of mathematical objects, one of the fundamental questions is to determine their full automorphism group. In this paper this question is considered in the context of even/odd permutations dichotomy. More…