English
Related papers

Related papers: Irregular labeling on Abelian groups of digraphs

200 papers

Let $G$ be a finite group. The solubility graph associated with the finite group $G$, denoted by $\Gamma_{\cal S}(G)$, is a simple graph whose vertices are the non-trivial elements of $G$, and there is an edge between two distinct elements…

Group Theory · Mathematics 2020-03-04 B. Akbari , Mark L. Lewis , J. Mirzajani , A. R. Moghaddamfar

In this paper we define some new labellings for trees, called the in-improper and out-improper odd-graceful labellings such that some trees labelled with the new labellings can induce graceful graphs having at least a cycle. We, next, apply…

Discrete Mathematics · Computer Science 2015-12-31 Hongyu Wang , Jin Xu , Bing Yao

By Theorem~1.12 of the paper "A Class of Representations of Hecke Algebras", if $W$ is a Coxeter group whose proper parabolic subgroups are finite, and if the module of a finite $W$-digraph $\Gamma$ is isomorphic to the module of a…

Representation Theory · Mathematics 2021-10-28 Dean Alvis

We study the dilatation of outer automorphisms of right-angled Artin groups. Given a right-angled Artin group defined on a simplicial graph: $A(\Gamma) = \langle V | E \rangle$ and an automorphism $\phi \in Out(A(\Gamma))$ there is a…

Group Theory · Mathematics 2018-11-06 Corey Bregman , Yulan Qing

Albertson defined the irregularity of a graph $G$ as $irr(G)=\sum\limits_{uv\in E(G)}|d_G(u)-d_G(v)|$. For a graph $G$ with $n$ vertices, $m$ edges, maximum degree $\Delta$, and $d=\left\lfloor \frac{\Delta m}{\Delta n-m}\right\rfloor$, we…

Combinatorics · Mathematics 2023-03-23 Dieter Rautenbach , Florian Werner

We consider extremal problems for subgraphs of pseudorandom graphs. For graphs $F$ and $\Gamma$ the generalized Tur\'an density $\pi_F(\Gamma)$ denotes the density of a maximum subgraph of $\Gamma$, which contains no copy of~$F$. Extending…

Combinatorics · Mathematics 2016-03-15 Elad Aigner-Horev , Hiep Hàn , Mathias Schacht

A graph is called a GRR if its automorphism group acts regularly on its vertex-set. Such a graph is necessarily a Cayley graph. Godsil has shown that there are only two infinite families of finite groups that do not admit GRRs : abelian…

Combinatorics · Mathematics 2013-10-03 Joy Morris , Pablo Spiga , Gabriel Verret

We investigate the \textit{group sum chromatic number} ($\gchi(G)$) of graphs, i.e. the smallest value $s$ such that taking any Abelian group $\gr$ of order $s$, there exists a function $f:E(G)\rightarrow \gr$ such that the sums of edge…

Combinatorics · Mathematics 2016-03-04 Marcin Anholcer , Sylwia Cichacz

The commuting graph ${\Gamma(G)}$ of a group $G$ is the simple undirected graph with group elements as a vertex set and two elements $x$ and $y$ are adjacent if and only if $xy=yx$ in $G$. By eliminating the identity element of $G$ and all…

Combinatorics · Mathematics 2025-06-25 Siddharth Malviy , Vipul Kakkar

Let $G$ be a commutative algebraic group embedded in projective space and $\Gamma$ a finitely generated subgroup of $G$. From these data we construct a chain of algebraic subgroups of $G$ which is intimately related to obstructions to…

Number Theory · Mathematics 2012-09-12 Stéphane Fischler , Michael Nakamaye

Let $F$ and $G$ be simple finite undirected graphs. A graph $G$ is called $F$-irregular if any two of its distinct vertices belong to different numbers of copies of $F$ in $G$. According to the strong conjecture about $F$-irregular graphs…

Combinatorics · Mathematics 2026-02-27 Tatiana Dovzhenok

Let $\mathbb{P}^1$ and $(X,q)$ denote, respectively, the projective line and a fixed elliptic curve marked at its origin, both defined over an algebraically closed field $\mathbb{K}$ of arbitrary characteristic $\emph{\textbf{p}} \neq2$. We…

Algebraic Geometry · Mathematics 2010-11-15 Armando Treibich

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

The commuting graph of a non-abelian group is a simple graph in which the vertices are the non-central elements of the group, and two distinct vertices are adjacent if and only if they commute. In this paper, we classify (up to isomorphism)…

Group Theory · Mathematics 2013-11-26 Ashish Kumar Das , Deiborlang Nongsiang

Let $G$ be a real algebraic group defined over $\mathbb{Q}$, $\Gamma$ be an arithmetic subgroup of $G$, and $T$ be a maximal $\mathbb{R}$-split torus. A trajectory in $G/\Gamma$ is divergent if eventually it leaves every compact subset. In…

Dynamical Systems · Mathematics 2019-08-14 Nattalie Tamam

Schreier graphs, which possess both a graph structure and a Schreier structure (an edge-labeling by the generators of a group), are objects of fundamental importance in group theory and geometry. We study the Schreier structures with which…

Dynamical Systems · Mathematics 2014-06-02 Jan Cannizzo

Let $M_n$ denote the algebra of $n \times n$ complex matrices and let $\mathcal{A}\subseteq M_n$ be an arbitrary structural matrix algebra, i.e. a subalgebra of $M_n$ that contains all diagonal matrices. We consider injective maps $\phi :…

Rings and Algebras · Mathematics 2025-11-26 Ilja Gogić , Mateo Tomašević

We provide an algebraic characterization of strong ordered Abelian groups: An ordered Abelian group is strong iff it has bounded regular rank and almost finite dimension. Moreover, we show that any strong ordered Abelian group has finite…

Logic · Mathematics 2017-06-20 Rafel Farré

Given an edge labeling $f$ of a graph $G$, a vertex $v$ is called an $AR$-vertex, if $v$ has distinct edge weight sums for each distinct subset of edges incident on $v$. An injective edge labeling $f$ of a graph $G$ is called an…

Combinatorics · Mathematics 2025-02-27 Arun J Manattu , Aparna Lakshmanan S

Let $A$ be an abelian group and let $\iota$ be the automorphism of $A$ defined by $i:a\mapsto a^{-1}$. A Cayley graph $\Gamma=\mathrm{Cay}(A,S)$ is said to have an automorphism group \emph{as small as possible} if $\mathrm{Aut}(\Gamma)=…

Combinatorics · Mathematics 2014-05-09 Edward Dobson , Pablo Spiga , Gabriel Verret
‹ Prev 1 8 9 10 Next ›