Related papers: Balanced Abelian group valued functions on directe…
We characterize strongly edge regular product graphs and find the edge-balanced index sets of complete bipartite graphs without a perfect matching, the direct product $K_n\times K_2$. We also prove a lemma that is helpful to determine the…
Consider a directed multigraph $D$ that is balanced (i.e., at each vertex, the indegree equals the outdegree). Let $A$ be its set of arcs. Fix an integer $k$. Let $s$ be a vertex of $D$. We show that the number of $k$-element subsets $B$ of…
A group is called metahamiltonian if all non-abelian subgroups of it are normal. This concept is a natural generalization of Hamiltonian groups. In this paper, the properties of finite metahamiltonian $p$-groups are investigated.
For a given function from a set to itself, we can define a directed graph called the functional graph, where the vertices are the elements of the set, and the edges are all the pairs of inputs and outputs for the function. In this article…
We give a classification and complete algebraic description of groups allowing only finitely many (left multiplication invariant) circular orders. In particular, they are all solvable groups with a specific semi-direct product…
With every matching in a graph we associate a group called the matching group. We study this group using the theory of non-positively curved cubed complexes. Our approach is formulated in terms of so-called gliding systems.
The structure of the Tate-Shafarevich groups of a class of elliptic curves over global function fields is determined. These are known to be finite abelian groups from the monograph [1] and hence they are direct sums of finite cyclic groups…
Given a directed graph, an equivalence relation on the graph vertex set is said to be balanced if, for every two vertices in the same equivalence class, the number of directed edges from vertices of each equivalence class directed to each…
We consider directed weighted graphs and define various families of path counting functions. Our main results are explicit formulas for the main term of the asymptotic growth rate of these counting functions, under some irrationality…
We show that finitely generated Abelian groups admit equal growth functions with respect to symmetric generating sets if and only if they have the same rank and the torsion parts have the same parity. In contrast, finitely generated Abelian…
The (proper) power graph of a group is a graph whose vertex set is the set of all (nontrivial) elements of the group and two distinct vertices are adjacent if one is a power of the other. Various kinds of planarity of (proper) power graphs…
Consider the random Cayley graph of a finite group $G$ with respect to $k$ generators chosen uniformly at random, with $1 \ll \log k \ll \log |G|$; denote it $G_k$. A conjecture of Aldous and Diaconis (1985) asserts, for $k \gg \log |G|$,…
The power graph of a group $G$ is the graph whose vertex set is $G$ and two distinct vertices are adjacent if one is a power of the other. This paper investigates the minimal separating sets of power graphs of finite groups. For power…
Signed graphs are graphs with signed edges. They are commonly used to represent positive and negative relationships in social networks. While balance theory and clusterizable graphs deal with signed graphs to represent social interactions,…
Higher form symmetry, one of the generalized symmetries, primarily involves the action of abelian groups. This is, due to the topological nature of symmetry defect operators. In this study, we extend the vector space (or vector bundle) in…
We consider walks on the edges of the square lattice $\mathbb Z^2$ which obey \emph{two-step rules,} which allow (or forbid) steps in a given direction to be followed by steps in another direction. We classify these rules according to a…
A certain class of directed metric graphs is considered. Asymptotics for a number of possible endpoints of a random walk at large times is found.
A biased graph is a graph with a class of selected circles ("cycles", "circuits"), called balanced, such that no theta subgraph contains exactly two balanced circles. A biased graph $\Omega$ has two natural matroids, the frame matroid…
We prove by using simple number-theoretic arguments formulae concerning the number of elements of a fixed order and the number of cyclic subgroups of a direct product of several finite cyclic groups. We point out that certain multiplicative…
Let A be an evolution algebra (possibly infinite-dimensional) equipped with a fixed natural basis B, and let E be the associated graph defined by Elduque and Labra. We describe the group of automorphisms of A that are diagonalizable with…