English
Related papers

Related papers: On minimal graphs for hamiltonian groups and their…

200 papers

A dominating set of a graph $G$ is a set $D\subseteq V_G$ such that every vertex in $V_G-D$ is adjacent to at least one vertex in $D$, and the domination number $\gamma(G)$ of $G$ is the minimum cardinality of a dominating set of $G$. In…

Combinatorics · Mathematics 2019-08-13 Mateusz Miotk , Jerzy Topp , Paweł Żyliński

We study the problem of counting the number of homomorphisms from an input graph $G$ to a fixed (quantum) graph $\bar{H}$ in any finite field of prime order $\mathbb{Z}_p$. The subproblem with graph $H$ was introduced by Faben and Jerrum…

Computational Complexity · Computer Science 2022-08-19 J. A. Gregor Lagodzinski , Andreas Göbel , Katrin Casel , Tobias Friedrich

A group of bijections G acting on a set X is said with fixed points (abbreviated as gaf from the french "groupe {\`a} points fixes") if any element of G has at least one fixed point in X. The G group is said with a common fixed point…

Group Theory · Mathematics 2019-01-28 Guido Ahumada , Bernard Brighi , Nicolas Chevallier , Augustin Fruchard

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.

Group Theory · Mathematics 2014-10-23 Lijian An , Qinhai Zhang

Suppose G is a finite group, such that |G| = 27p, where p is prime. We show that if S is any generating set of G, then there is a hamiltonian cycle in the corresponding Cayley graph Cay(G;S).

Combinatorics · Mathematics 2011-04-22 Ebrahim Ghaderpour , Dave Witte Morris

A circle of an infinite locally finite graph $G$ is the imagine of a homeomorphic mapping of the unit circle $S^1$ in $|G|$, the Freudenthal compactification of $G$. A circle of $G$ is Hamiltonian if it meets every vertex (and then every…

Combinatorics · Mathematics 2019-04-29 Binlong Li

Let $\Gamma$ be a finite graph and let $A(\Gamma)$ be the corresponding right-angled Artin group. We characterize the Hamiltonicity of $\Gamma$ via the structure of the cohomology algebra of $A(\Gamma)$. In doing so, we define and develop a…

Group Theory · Mathematics 2021-08-25 Ramón Flores , Delaram Kahrobaei , Thomas Koberda

Let $G$ be a finite abelian group of order $n$. For any subset $B$ of $G$ with $B=-B$, the Cayley graph $G_B$ is a graph on vertex set $G$ in which $ij$ is an edge if and only if $i-j\in B.$ It was shown by Ben Green that when $G$ is a…

Number Theory · Mathematics 2009-05-20 Gyan Prakash

A recent development in graph-minor theory is to study local separators, vertex-sets that separate graphs locally but not necessarily globally. The local separators of a graph roughly correspond to the genuine separators of its local…

Combinatorics · Mathematics 2025-01-15 Johannes Carmesin , George Kontogeorgiou , Jan Kurkofka , Will J. Turner

We study a class of finite groups $G$ which behave similarly to elementary abelian $p$-groups with $p$ prime, that is, there exists a subgroup $N$ such that all elements of $G\setminus N$ are conjugate or inverse-conjugate under $\Aut(G)$.…

Group Theory · Mathematics 2018-01-30 Lei Wang , Yin Liu

We prove that for any automorphism $\alpha$ of a free group F of finite rank, one can efficiently compute a basis of the fixed point subgroup Fix(\alpha).

Group Theory · Mathematics 2014-01-16 Oleg Bogopolski , Olga Maslakova

A well-known result of Tutte says that if Gamma is an Abelian group and G is a graph having a nowhere-zero Gamma-flow, then G has a nowhere-zero Gamma'-flow for each Abelian group Gamma' whose order is at least the order of Gamma. Jaeger,…

Combinatorics · Mathematics 2020-10-15 Rikke Langhede , Carsten Thomassen

Recently there has been growing interest in discrete homotopies and homotopies of graphs beyond treating graphs as 1-dimensional simplicial spaces. One such type of homotopy is $\times$-homotopy. Recent work by Chih-Scull has developed a…

Combinatorics · Mathematics 2025-04-22 Keira Behal , Tien Chih

The Gruenberg-Kegel graph $\Gamma(G)$ associated with a finite group $G$ has as vertices the prime divisors of $|G|$, with an edge from $p$ to $q$ if and only if $G$ contains an element of order $pq$. This graph has been the subject of much…

Group Theory · Mathematics 2023-02-01 Peter J. Cameron , Natalia V. Maslova

An $L(2,1)$-labelling of a finite graph $\Gamma$ is a function that assigns integer values to the vertices $V(\Gamma)$ of $\Gamma$ (colouring of $V(\Gamma)$ by ${\mathbb{Z}}$) so that the absolute difference of two such values is at least…

Group Theory · Mathematics 2021-06-18 Mayank Mishra , Siddhartha Sarkar

For a non-negative integer $s\le |V(G)|-3$, a graph $G$ is $s$-Hamiltonian if the removal of any $k\le s$ vertices results in a Hamiltonian graph. Given a connected simple graph $G$ that is not isomorphic to a path, a cycle, or a $K_{1,3}$,…

Combinatorics · Mathematics 2023-06-22 Sulin Song , Lan Lei , Yehong Shao , Hong-Jian Lai

The distinguishing number $D(G)$ of a graph $G$ is the least integer $d$ such that $G$ has an vertex labeling with $d$ labels that is preserved only by a trivial automorphism. The minimum size of a label class in such a labeling of $G$ with…

Combinatorics · Mathematics 2017-10-23 Saeid Alikhani , Samaneh Soltani

A metric graph is a geometric realization of a finite graph by identifying each edge with a real interval. A divisor on a metric graph $\Gamma$ is an element of the free abelian group on $\Gamma$. The rank of a divisor on a metric graph is…

Combinatorics · Mathematics 2013-05-01 Ye Luo

This paper gives a new explicit construction of the $\mathbb{Q}$-algebraic hull for virtually solvable groups $\Gamma$ of finite abelian ranks, taking into account the spectrum $S$ of the group $\Gamma$. As an application, we make a…

Group Theory · Mathematics 2026-02-24 Jonas Deré , Mark Pengitore

Let $G=(V,E)$ be a graph. An ordering of $G$ is a bijection $\alpha: V\dom \{1,2,..., |V|\}.$ For a vertex $v$ in $G$, its closed neighborhood is $N[v]=\{u\in V: uv\in E\}\cup \{v\}.$ The profile of an ordering $\alpha$ of $G$ is…

Data Structures and Algorithms · Computer Science 2007-05-23 Gregory Gutin , Stefan Szeider , Anders Yeo