English
Related papers

Related papers: Enumeration of dicirculant digraphs

200 papers

For every prime $p > 2$ we exhibit a Cayley graph of $\mathbb{Z}_p^{2p+3}$ which is not a CI-graph. This proves that an elementary Abelian $p$-group of rank greater than or equal to $2p+3$ is not a CI-group. The proof is elementary and uses…

Combinatorics · Mathematics 2009-11-17 Gabor Somlai

We provide upper bounds on the $L(p,q)$-labeling number of graphs which have interval (or circular-arc) representations via simple greedy algorithms. We prove that there exists an $L(p,q)$-labeling with span at most…

Combinatorics · Mathematics 2023-07-28 Mehmet Akif Yetim

For a graph $\Gamma$, the multiplicity of the eigenvalue $0$, denoted by $\eta(\Gamma)$, is called the nullity of $\Gamma$. Also the energy of $\Gamma$, denoted by $\mathcal{E}(\Gamma)$, is defined as the sum of the absolute values of the…

Combinatorics · Mathematics 2024-10-24 Mahdi Ebrahimi

If $D$ is the definite quaternion algebra over $\qu$ of discriminant $p$, we compute, for any prime $p>3$, the number of infinite dimensional cusp forms on $D^*$ which are trivial at infinity, tamely ramified at $p$, and have given…

Number Theory · Mathematics 2011-08-08 Tommaso Giorgio Centeleghe

Given a finite transitive permutation group $G\leq \operatorname{Sym}(\Omega)$, with $|\Omega|\geq 2$, the derangement graph $\Gamma_G$ of $G$ is the Cayley graph $\operatorname{Cay}(G,\operatorname{Der}(G))$, where $\operatorname{Der}(G)$…

Combinatorics · Mathematics 2021-09-07 Andriaherimanana Sarobidy Razafimahatratra

It is known that there are infinitely-many prime numbers which take the form of a polynomial of degree one with integer coefficients, this is Dirichlet's theorem. We use an elementary sieving argument together with bounds on the prime…

Number Theory · Mathematics 2017-07-24 Acquaah Peter

We describe computational results about undirected graphs having $10$ vertices and automorphism group isomorphic to $\mathbb{Z}/4\mathbb{Z}$.

Combinatorics · Mathematics 2015-04-06 Peteris Daugulis

Let $N(x,y)$ denote the number of integers $n\le x$ which are divisible by a shifted prime $p-1$ with $p>y$, $p$ prime. Improving upon recent bounds of McNew, Pollack and Pomerance, we establish the exact order of growth of $N(x,y)$ for all…

Number Theory · Mathematics 2019-10-22 Kevin Ford

We consider finite dimensional representations of the dihedral group $D_{2p}$ over an algebraically closed field of characteristic two where $p$ is an odd integer and study the degrees of generating and separating polynomials in the…

Commutative Algebra · Mathematics 2016-08-14 Martin Kohls , Müfit Sezer

Paley graphs are Cayley graphs which are circulant and strongly regular. Paley-type graph of order a product of two distinct Pythagorean primes was introduced by Dr Angsuman Das. In this paper, we extend the study of Paley-type graphs to…

Combinatorics · Mathematics 2023-10-09 Sivaranjani A , Radha S

In this paper we enumerate $k$-noncrossing tangled-diagrams. A tangled-diagram is a labeled graph whose vertices are $1,...,n$ have degree $\le 2$, and are arranged in increasing order in a horizontal line. Its arcs are drawn in the upper…

Combinatorics · Mathematics 2008-02-26 William Y. C. Chen , Jing Qin , Christian M. Reidys , Doron Zeilberger

In recent work, we study certain Cayley graphs associated with a finite commutative ring and their multiplicative subgroups. Among various results that we prove, we provide the necessary and sufficient conditions for such a Cayley graph to…

Combinatorics · Mathematics 2024-03-12 Tung T. Nguyen , Nguyen Duy Tân

New criteria for which Cayley graphs of cyclic groups of any order can be completely determined--up to isomorphism--by the eigenvalues of their adjacency matrices is presented. Secondly, a new construction for pairs of nonisomorphic Cayley…

Combinatorics · Mathematics 2009-04-14 Julia Brown

We investigate which invariants of groups are powerful in distinguishing non-isomorphic p-groups. We introduce the notations of siblings and twins for p-groups that are difficult to distinguish and we describe the siblings and twins among…

Group Theory · Mathematics 2026-03-11 Bettina Eick , Henrik Schanze

In this paper we enumerate nonhyperelliptic superspecial curves of genus $4$ over prime fields of characteristic $p\le 11$. Our algorithm works for nonhyperelliptic curves over an arbitrary finite field in characteristic $p \ge 5$. We…

Algebraic Geometry · Mathematics 2021-10-04 Momonari Kudo , Shushi Harashita

Spanning trees of complete bipartite graphs exhibit a rich interaction between degree sequences and graph structure. In this paper, we obtain lower bounds on the number of isomorphism classes of spanning trees in $K_{a,b}, 2 \leq a \leq b$…

Combinatorics · Mathematics 2026-03-03 Peter Johnson , Shayne Nochumson

A graph drawn on the plane is called $1$-plane if each edge is crossed at most once by another edge. In this paper, we show that every $4$-connected $1$-plane graph has a connected spanning plane subgraph. We also show that there exist…

Combinatorics · Mathematics 2024-04-09 Kenta Noguchi , Katsuhiro Ota , Yusuke Suzuki

A connected linear algebraic group G is called a Cayley group if the Lie algebra of G endowed with the adjoint G-action and the group variety of G endowed with the conjugation G-action are birationally G-isomorphic. In particular, the…

Algebraic Geometry · Mathematics 2009-07-06 Nicole Lemire , Vladimir L. Popov , Zinovy Reichstein

We count the number of isomorphism classes of degree $d$-twists of some polarized abelian varieties over finite fields of odd prime dimension. This can be seen as a higher dimensional analogue of the counting problem for elliptic curves…

Number Theory · Mathematics 2020-06-16 WonTae Hwang , Keunyoung Jeong

It is known that isomorphisms of graph Jacobians induce cyclic bijections on the associated graphs. We characterize when such cyclic bijections can be strengthened to graph isomorphisms, in terms of an easily computed divisor. The result…

Combinatorics · Mathematics 2023-07-25 Sarah Griffith