相关论文: On some graph-cordial Abelian groups

Let $G$ be a finite, non-abelian group of the form $G = A N$, where $A \leq G$ is abelian, and $N \trianglelefteq G$ is cyclic. We prove that the commuting graph $\Gamma(G)$ of $G$ is either a connected graph of diameter at most four, or…

Chordal graphs are the graphs in which every cycle of length at least four has a chord. A set $S$ is a vertex separator for vertices $a$ and $b$ if the removal of $S$ of the graph separates $a$ and $b$ into distinct connected components. A…

A \emph{group distance magic labeling} or a $\gr$-distance magic labeling of a graph $G(V,E)$ with $|V | = n$ is an injection $f$ from $V$ to an Abelian group $\gr$ of order $n$ such that the weight $w(x)=\sum_{y\in N_G(x)}f(y)$ of every…

Perfect graphs form one of the distinguished classes of finite simple graphs. In 2006, Chudnovsky, Robertson, Seymour and Thomas proved that a graph is perfect if and only if it has no odd holes and no odd antiholes as induced subgraphs,…

For a finite group $G$, we define the inclusion graph of subgroups of $G$, denoted by $\mathcal I(G)$, is a graph having all the proper subgroups of $G$ as its vertices and two distinct vertices $H$ and $K$ in $\mathcal I(G)$ are adjacent…

Let $G$ be an abelian group. The main theorem of this paper asserts that there exists a Cayley graph on $G$ with chromatic number $3$ if and only if $G$ is not of exponent $1$, $2$, or $4$. For connected Cayley graphs, we also show that…

We show that Cayley graphs of finitely generated Abelian groups are rather rigid. As a consequence we obtain that two finitely generated Abelian groups admit isomorphic Cayley graphs if and only if they have the same rank and their torsion…

These notes concern aspects of various graphs whose vertex set is a group $G$ and whose edges reflect group structure in some way (so that they are invariant under the action of the automorphism group of $G$). The graphs I will discuss are…

We discuss functions from edges and vertices of an undirected graph to an Abelian group. Such functions, when the sum of their values along any cycle is zero, are called balanced labelings. The set of balanced labelings forms an Abelian…

We construct an embedding G of the category of graphs into the category of abelian groups such that for graphs X and Y we have Hom(GX,GY)=Z[Hom(X,Y)], the free abelian group whose basis is the set Hom(X,Y). The isomorphism is functorial in…

Graph labelling is one of the noticed contexts in combinatorics and graph theory. Graceful labelling for a graph $G$ with $e$ edges, is to label the vertices of $G$ with $0, 1, \cdots, e$ such that, if we specify to each edge the difference…

An antimagic labeling of a graph $G$ with $m$ edges is a bijection from $E(G)$ to $\{1,2,\ldots,m\}$ such that for all vertices $u$ and $v$, the sum of labels on edges incident to $u$ differs from that for edges incident to $v$. Hartsfield…

We investigate the \textit{group irregularity strength} ($s_g(G)$) of graphs, i.e. the smallest value of $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…

There are many variations on partition functions for graph homomorphisms or colorings. The case considered here is a counting or hard constraint problem in which the range or color graph carries a free and vertex transitive Abelian group…

A $\Gamma$\emph{-distance magic labeling} of a graph $G = (V, E)$ with $|V| = n$ is a bijection $\ell$ from $V$ to an Abelian group $\Gamma$ of order $n$, for which there exists $\mu \in \Gamma$, such that the weight $w(x) =\sum_{y\in…

Let S be a closed oriented surface of genus g > 1, and let T denote its Torelli group. First, given a set E of homotopically nontrivial, pairwise disjoint, pairwise nonisotopic simple closed curves on S, we determine precisely when a…

Consider an undirected graph whose edges are labeled invertibly in a group. When does every Eulerian trail from one fixed vertex to another have the same label? We give a precise structural answer to this question. Essentially, we show that…

Let $G$ be a finite group and $S$ be a subset of $G.$ A bi-Cayley graph $\BCay(G,S)$ is a simple and an undirected graph with vertex-set $G\times\{1,2\}$ and edge-set $\{\{(g,1),(sg,2)\}\mid g\in G, s\in S\}$. A bi-Cayley graph $\BCay(G,S)$…

It was shown by Beisegel, Chudnovsky, Gurvich, Milani\v{c}, and Servatius in 2022 that every induced $2$-edge path in a vertex-transitive graph closes to an induced cycle. Similar results were obtained for 3-edge paths closing to cycles in…

Let $p$ be an odd prime. For a simple connected graph $G$ of order $n$, a bijective function $f:V(G)\to\{1,2,\ldots,n\}$ is said to be a Legendre cordial labeling modulo $p$ if the induced function $f_p^*:E(G)\to \{0,1\}$, defined by $f_p^*…