Related papers: Path-cordial abelian groups
Hadwiger's conjecture asserts that any graph contains a clique minor with order no less than the chromatic number of the graph. We prove that this well-known conjecture is true for all graphs if and only if it is true for squares of split…
In this paper we prove the Geyer-Jarden conjecture on the torsion part of the Mordell-Weil group for a large class of abelian varieties defined over finitely generated fields of arbitrary characteristic. The class consists of all abelian…
It is well-known that the graphs not containing a given graph H as a subgraph have bounded chromatic number if and only if H is acyclic. Here we consider ordered graphs, i.e., graphs with a linear ordering on their vertex set, and the…
A \emph{Fibonacci cordial labeling} of a graph \( G \) is an injective function \( f: V(G) \rightarrow \{F_0, F_1, \dots, F_n\} \), where \( F_i \) denotes the \( i^{\text{th}} \) Fibonacci number, such that the induced edge labeling \(…
We classify the connected-homogeneous digraphs with more than one end. We further show that if their underlying undirected graph is not connected-homogeneous, they are highly-arc-transitive.
For any finite abelian group $G$ and any subset $S\seq G$, we determine the connectivity of the addition Cayley graph induced by $S$ on $G$. Moreover, we show that if this graph is not complete, then it possesses a minimum vertex cut of a…
As it is well known, one can define an abelian group on the points of an elliptic curve, using the so called chord-tangent law \cite{dale}, and a chosen point. However, that very chord-tangent law allows us to define a rather more obscure…
In this article, we give an elementary combinatorial proof of a conjecture about the determination of automorphism group of the power graph of finite cyclic groups, proposed by Doostabadi, Erfanian and Jafarzadeh in 2013.
Let $p\ge 3$ be a prime. A generalised multi-edge spinal group is a subgroup of the automorphism group of a regular $p$-adic rooted tree T that is generated by one rooted automorphism and $p$ families of directed automorphisms, each family…
Abelian Cayley digraphs can be constructed by using a generalization to $Z^n$ of the concept of congruence in $Z$. Here we use this approach to present a family of such digraphs, which, for every fixed value of the degree, have…
An edge coloring of a graph $G$ is to color all the edges in the graph such that adjacent edges receive different colors. It is acyclic if each cycle in the graph receives at least three colors. Fiam{\v{c}}ik (1978) and Alon, Sudakov and…
A number of authors have studied the question of when a graph can be represented as a Cayley graph on more than one nonisomorphic group. The work to date has focussed on a few special situations: when the groups are $p$-groups; when the…
A graph $\Gamma$ labelled by a set $S$ defines a group $G(\Gamma)$ whose generators are the set of labels $S$ and whose relations are all words which can be read on closed paths of this graph. We introduce the notion of aspherical graph and…
We propose a simple criterion to know if an abelian variety $A$ defined over a finite field $\mathbb{F}_q$ is cyclic, i.e., it has a cyclic group of rational points; this criterion is based on the endomorphism ring End$_{\mathbb{F}_q}(A)$.…
Bayesian networks are a widely-used class of probabilistic graphical models capable of representing symmetric conditional independence between variables of interest using the topology of the underlying graph. For categorical variables, they…
Given two hyperbolic curves over p-adic local fields, the absolute anabelian conjecture claims that any isomorphism between their \'etale fundamental group comes from an isomorphism of schemes. This conjecture was proven by S. Mochizuki for…
We introduce and study asymptotically rigid mapping class groups of certain infinite graphs. We determine their finiteness properties and show that these depend on the number of ends of the underlying graph. In a special case where the…
A graph $G$ is \textit{asymmetric} if its automorphism group of vertices is trivial. Asymmetric graphs were introduced by Erd\H{o}s and R\'{e}nyi in 1963. They showed that the probability of a graph on $n$ vertices being asymmetric tends to…
Let G_1 and G_2 be two groups. If a group homomorphism \varphi : G_1 \longrightarrow G_2 maps a \in G_1 into b \in G_2 such that \varphi(a) = b, then we say a degenerates to b and if every element of G_1 degenerates to elements in G_2, then…
The directions of an infinite graph $G$ are a tangle-like description of its ends: they are choice functions that choose compatibly for all finite vertex sets $X\subseteq V(G)$ a component of $G-X$. Although every direction is induced by a…