English
Related papers

Related papers: Orientable $\mathbb{Z}{}_{n}$-distance magic regul…

200 papers

In a recent paper by a superset of the authors it was proved that for every primitive 3-constrained space $\Gamma$ of finite diameter $\delta$ from Cherlin's catalogue of metrically homogeneous graphs, there exists a finite family $\mathcal…

Combinatorics · Mathematics 2025-11-03 Jan Hubička , Michael Kompatscher , Matěj Konečný

Let $G$ be a finite group. For a fixed element $g$ in $G$ and a given subgroup $H$ of $G$, the relative $g$-noncommuting graph of $G$ is a simple undirected graph whose vertex set is $G$ and two vertices $x$ and $y$ are adjacent if $x \in…

Group Theory · Mathematics 2020-08-11 Monalisha Sharma , Rajat Kanti Nath

An edge uv in a graph \Gamma\ is directionally 2-signed (or, (2,d)-signed) by an ordered pair (a,b), a,b in {+,-}, if the label l(uv) = (a,b) from u to v, and l(vu) = (b,a) from v to u. Directionally 2-signed graphs are equivalent to…

Combinatorics · Mathematics 2016-10-18 E. Sampathkumar , M. A. Sriraj , Thomas Zaslavsky

Let $N$ be a closed nonorientable surface with or without marked points. In this paper we prove that, for every finite full subgraph $\Gamma$ of $\mathcal{C}^{\mathrm{two}}(N)$, the right-angled Artin group on $\Gamma$ can be embedded in…

Geometric Topology · Mathematics 2023-08-25 Takuya Katayama , Erika Kuno

We define a labeling $f:$ $V(G)$ $\rightarrow$ $\{1, 2, \ldots, n\}$ on a graph $G$ of order $n \geq 3$ as a \emph{$k$-distance magic} ($k$-DM) if $\sum_{w\in \partial N_k(u)}{ f(w)}$ is a constant and independent of $u\in V(G)$ where…

Combinatorics · Mathematics 2022-11-22 V. Vilfred Kamalappan

We provide a summary of research on disjoint zero-sum subsets in finite Abelian groups, which is a branch of additive group theory and combinatorial number theory. An orthomorphism of a group $\Gamma$ is defined as a bijection $\varphi$…

Combinatorics · Mathematics 2024-10-30 Sylwia Cichacz

Given a family of hypergraphs $\mathcal{H}$, we say that a hypergraph $\Gamma$ is $\mathcal{H}$-universal if it contains every $H \in \mathcal{H}$ as a subgraph. For $D, r \in \mathbb{N}$, we construct an $r$-uniform hypergraph with…

Combinatorics · Mathematics 2024-12-02 Rajko Nenadov

In this paper we introduce a new domination problem strongly related to the following one recently proposed by Broe, Chartrand and Zhang. One says that a vertex $v$ of a graph $\Gamma$ labeled with an integer $\ell$ dominates the vertices…

Combinatorics · Mathematics 2024-10-08 Lorenzo Mella , Anita Pasotti

A graph $G$ with $p$ vertices and $q$ edges has an antimagic labelling if there is a bijection from the graph's edge set to the label set $\left\{1,2, \cdots, q \right\}$ such that $p$ vertices must have distinct vertex sums, where the…

Combinatorics · Mathematics 2024-05-08 Vinothkumar Latchoumanane , Murugan Varadhan

In this paper a classification of tetravalent edge-transitive metacirculants is given. It is shown that a tetravalent edge-transitive metacirculant $\Gamma$ is a normal graph except for four known graphs. If further, $\Gamma$ is a Cayley…

Combinatorics · Mathematics 2016-03-29 Shu Jiao Song

The Huneke-Wiegand conjecture is a decades-long open question in commutative algebra. Garc\'ia-S\'anchez and Leamer showed that a special case of this conjecture concerning numerical semigroup rings $\Bbbk[\Gamma]$ can be answered in the…

Commutative Algebra · Mathematics 2024-04-22 Miguel Landeros , Christopher O'Neill , Roberto Pelayo , Karina Peña , James Ren , Brian Wissman

In this paper, we introduce a new model to study network reliability with node failures. This model, strongly connected node reliability, is the directed variant of node reliability and measures the probability that the operational vertices…

Combinatorics · Mathematics 2022-06-27 Danielle Cox , Kyle MacKeigan , Emily Wright

Let $G$ be $2$-generated group. The generating graph of $\Gamma(G)$ is the graph whose vertices are the elements of $G$ and where two vertices $g$ and $h$ are adjacent if $G=\langle g,h\rangle$. This graph encodes the combinatorial…

Group Theory · Mathematics 2020-06-15 Scott Harper , Andrea Lucchini

The non-commuting graph $\Gamma_R$ of a finite ring $R$ with center $Z(R)$ is a simple undirected graph whose vertex set is $R \setminus Z(R)$ and two distinct vertices $a$ and $b$ are adjacent if and only if $ab \ne ba$. In this paper, we…

Rings and Algebras · Mathematics 2017-03-16 J. Dutta , D. K. Basnet

We consider the notions of sum graph and of relaxed sum graph over a magma, give several examples and results of these families of graphs over some natural magmas. We classify the cycles that are sum graphs for the magma of the subsets of a…

Combinatorics · Mathematics 2024-01-19 António Machiavelo , Rogério Reis

In this paper we construct all strongly regular graphs, with at most 600 vertices, admitting a transitive action of the orthogonal group $O^+(6,2)$ or $O^-(6,2)$. Consequently, we prove the existence of strongly regular graphs with…

Combinatorics · Mathematics 2016-12-06 Dean Crnković , Sanja Rukavina , Andrea Švob

We study finite four-valent graphs Gamma admitting an edge-transitive group G of automorphisms such that G determines and preserves an edge-orientation on Gamma, and such that at least one G-normal quotient is a cycle (a quotient modulo the…

Combinatorics · Mathematics 2016-12-20 Jehan A. Al-bar , Ahmad N. Al-kenani , Najat Mohammad Muthana , Cheryl E. Praeger

Given graphs $X$ and $Y$ with vertex sets $V(X)$ and $V(Y)$ of the same cardinality, the friends-and-strangers graph $\mathsf{FS}(X,Y)$ is the graph whose vertex set consists of all bijections $\sigma:V(X)\to V(Y)$, where two bijections…

Combinatorics · Mathematics 2021-06-16 Noga Alon , Colin Defant , Noah Kravitz

We show that arising out of noncmmutatve geometry is a natural family of {\em edge Laplacians} on the edges of a graph. The family includes a canonical edge Laplacian associated to the graph, extending the usual graph Laplacian on vertices,…

Quantum Algebra · Mathematics 2015-03-17 Shahn Majid

A normally regular digraph with parameters $(v,k,\lambda,\mu)$ is a directed graph on $v$ vertices whose adjacency matrix $A$ satisfies the equation $AA^t=k I+\lambda (A+A^t)+\mu(J-I-A-A^t)$. This means that every vertex has out-degree $k$,…

Combinatorics · Mathematics 2014-10-31 Leif K Jørgensen
‹ Prev 1 8 9 10 Next ›