Related papers: Group vertex magicness of product graphs and trees
In this paper, we give a characterization of unicyclic graphs with diameter at most 4 which are A-vertex magic. Moreover, let G be a bicyclic graph of diameter 3, then G is group vertex magic if and only if G = M11(0, 0).
In this paper, we provide few results on the group distance magic labeling of lexicographic product and direct product of two graphs. We also prove some necessary conditions for a graph to be group distance magic and provide a…
Let G be a simple undirected graph and let A be an additive Abelian group with identity 0. In this paper, we introduce the concept of group magic spectrum of a graph G with respect to a given Abelian group A and is defined as spec(G, A):=…
The power graph of a group $G$, denoted as $P(G)$, constitutes a simple undirected graph characterized by its vertex set $G$. Specifically, vertices $a,b$ exhibit adjacency exclusively if $a$ belongs to the cyclic subgroup generated by $b$…
In this paper we have discussed the group vertex magicness of H-join of family of graphs and generalized friendship graph.
Given a graph $G$ with $n$ vertices and an Abelian group $A$ of order $n$, an $A$-distance antimagic labelling of $G$ is a bijection from $V(G)$ to $A$ such that the vertices of $G$ have pairwise distinct weights, where the weight of a…
Consider a group G and a family $\mathcal{A}$ of subgroups of G. We say that vertex finiteness holds for splittings of G over $\mathcal{A}$ if, up to isomorphism, there are only finitely many possibilities for vertex stabilizers of minimal…
The power graph of a given finite group is a simple undirected graph whose vertex set is the group itself, and there is an edge between any two distinct vertices if one is a power of the other. In this paper, we find a precise formula to…
This paper deals with the vertex connectivity of enhanced power graph of finite group. We classify all abelian groups G such that vertex connectivity of enhanced power graph of G is 1. We derive an upper bound of vertex connectivity for the…
A set of vertices $S$ \emph{resolves} a graph $G$ if every vertex is uniquely determined by its vector of distances to the vertices in $S$. The \emph{metric dimension} of a graph $G$ is the minimum cardinality of a resolving set. In this…
We show that if $G$ is a group and $G$ has a graph-product decomposition with finitely-generated abelian vertex groups, then $G$ has two canonical decompositions as a graph product of groups: a unique decomposition in which each vertex…
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…
Let $G$ be an undirected simple connected graph. We say a vertex $u$ is eccentric to a vertex $v$ in $G$ if $d(u,v)=\max\{d(v,w): w\in V(G)\}$. The eccentric graph, $E(G)$ of $G$ is a graph defined on the same vertex set as of $G$ and two…
Let $G$ be a non-abelian finite simple group. In addition, let $\Delta_G$ be the intersection graph of $G$, whose vertices are the proper nontrivial subgroups of $G$, with distinct subgroups joined by an edge if and only if they intersect…
We introduce the vertex-arboricity of group-labelled graphs. For an abelian group $\Gamma$, a $\Gamma$-labelled graph is a graph whose edges are labelled by elements of $\Gamma$. For an abelian group $\Gamma$ and $A\subseteq \Gamma$, the…
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…
We characterize the strong metric dimension of the power graph of a finite group. As applications, we compute the strong metric dimension of the power graph of a cyclic group, an abelian group, a dihedral group or a generalized quaternion…
In an earlier work, finite groups whose power graphs are minimally edge connected have been classified. In this article, first we obtain a necessary and sufficient condition for an arbitrary graph to be minimally edge connected.…
We prove that the invariably generating graph of a finite group can have an arbitrarily large number of connected components with at least two vertices.
A notion of \emph{graph-wreath product} is introduced. We obtain sufficient conditions for these products to satisfy the topologically inspired finiteness condition type $\operatorname{F}_n$. Under various additional assumptions we show…