相关论文: Group Vertex Magicness of H-join and Generalised F…
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 article, some necessary conditions of group vertex magicness of graphs with at least one pendant, group vertex magicness of product graphs, are proved. A characterization of group vertex magicness of trees of diameter up to 5. for…
If a vertex $v$ in a graph $G$ has degree larger than the average of the degrees of its neighbors, we call it a groupie in $G$. In the current work, we study the behavior of groupie in random multipartite graphs with the link probability…
The $H$-join of a family of graphs $\mathcal{G}=\{G_1, \dots, G_p\}$, also called the generalized composition, $H[G_1, \dots, G_p]$, where all graphs are undirected, simple and finite, is the graph obtained by replacing each vertex $i$ of…
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…
In this paper, we have studied the distance magic labelling of Generalised Mycielskian of a few families of graphs.
Considering a graph $H$ of order $p$, a generalized $H$-join operation of a family of graphs $G_1,..., G_p$, constrained by a family of vertex subsets $S_i \subseteq V(G_i)$, $i=1,..., p,$ is introduced. When each vertex subset $S_i$ is…
We consider the generalised friendship paradox, focussing on the number of triangles at a vertex as the relevant attribute. We show that, contrary to the setting where the attribute is the number of edges at a vertex or the number of wedges…
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…
The Divisibility Graph of a finite group $G$ has vertex set the set of conjugacy class lengths of non-central elements in $G$ and two vertices are connected by an edge if one divides the other. We determine the connected components of the…
The power graph of an arbitrary group $G$ is a simple graph with all elements of $G$ as its vertices and two vertices are adjacent if one is a positive power of another. In this paper, we generalize this concept to a graph whose vertices…
The vertices of a $k$-token graph of a graph $G$ correspond to $k$ indistinguishable tokens placed on $k$ different vertices of $G$. Changing some conditions on both the nature of the tokens and the number of tokens allowed in each vertex…
In this article, the distance magic index of certain important classes of partite graphs are determined.
Whiteley \cite{wh} gives a complete characterization of the infinitesimal flexes of complete bipartite frameworks. Our work generalizes a specific infinitesimal flex to include joined graphs, a family of graphs that contain the complete…
We show that certain graphs of groups with cyclic edge groups are aTmenable. In particular, this holds when each vertex group is either virtually special or acts properly and semisimply on $\mathbb{H}^n$.
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…
Recent work on the structure of social networks and the internet has focussed attention on graphs with distributions of vertex degree that are significantly different from the Poisson degree distributions that have been widely studied in…
Let G be a simple graph of order n. The domination polynomial of a graph is the generating function of its dominating sets. We study the domination polynomials of generalized friendship graphs. We also consider book graphs formed by joining…
As a main result of this paper we give conditions under which the generalized $X$-join of Cayley graphs is a Cayley graph. In particular, we show that $X$-join of isomorphic Cayley graphs is a Cayley grpah. To do this, new properties for a…
This paper deals with the problem of finding totally antimagic total labelings of complete bipartite graphs. We prove that complete bipartite graphs are totally antimagic total graphs. We also show that the join of complete bipartite graphs…