相关论文: On Distance Magic Harary Graphs

A graph $G$ is said to be distance magic if there exists a bijection $f:V\rightarrow \{1,2, \ldots , v\}$ and a constant {\sf k} such that for any vertex $x$, $\sum_{y\in N(x)} f(y) ={\sf k}$, where $N_(x)$ is the set of all neighbours 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…

For an arbitrary set of distances $D\subseteq \{0,1, \ldots, diam(G)\}$, a $D$-weight of a vertex $x$ in a graph $G$ under a vertex labeling $f:V\rightarrow \{1,2, \ldots , v\}$ is defined as $w_D(x)=\sum_{y\in N_D(x)} f(y)$, where $N_D(x)…

In this paper, we determine the distance magic index of lexicograph product of a regular graph with the complement of complete graph, disjoint union of m copies of complete multi- partite graph and disjoint union of m copies of…

Let $G=(V,E)$ be a graph of order $n$. A distance magic labeling of $G$ is a bijection $\ell \colon V\rightarrow {1,...,n}$ for which there exists a positive integer $k$ such that $\sum_{x\in N(v)}\ell (x)=k$ for all $v\in V $, where $N(v)$…

For a set of distances $D$, a graph $G$ of order $n$ is said to be $D-$magic if there exists a bijection $f:V\rightarrow \{1,2, \ldots, n\}$ and a constant $k$ such that for any vertex $x$, $\sum_{y\in N_D(x)} f(y) =k$, where…

A graph $G=(V,E)$ is said to be distance magic if there is a bijection $f$ from a vertex set of $G$ to the first $|V(G)|$ natural numbers such that for each vertex $v$, its weight given by $\sum_{u \in N(v)}f(u)$ is constant, where $N(v)$…

For an arbitrary set of distances $D\subseteq \{0,1, \ldots, d\}$, a graph $G$ is said to be $D$-distance magic if there exists a bijection $f:V\rightarrow \{1,2, \ldots , v\}$ and a constant {\sf k} such that for any vertex $x$,…

For a set of distances $D$, a graph $G$ on $n$ vertices is said to be $D$-magic if there exists a bijection $f:V\rightarrow \{1,2, \ldots , n\}$ and a constant $k$ such that for any vertex $x$, $\sum_{y\in N_D(x)} f(y) = k$, where…

A graph labeling assigns values to the components of a graph (vertices, edges, etc.). In particular, distance magic labelings have been widely studied in undirected graphs. In such a labeling, the vertices are labeled with unique values…

Let $G$ be a complete $k$-partite simple undirected graph with parts of sizes $p_1\le p_2...\le p_k$. Let $P_j=\sum_{i=1}^jp_i$ for $j=1,...,k$. It is conjectured that $G$ has distance magic labeling if and only if $\sum_{i=1}^{P_j}…

A graph of order $n$ is distance magic if it admits a bijective labeling of its vertices with integers from $1$ to $n$ such that each vertex has the same sum of the labels of its neighbors. In this paper we classify all distance magic…

Let $G$ be a simple graph with vertex set $V(G) = \{v_1 ,v_2 ,\cdots ,v_n\}$. The Harary matrix $RD(G)$ of $G$, which is initially called the reciprocal distance matrix, is an $n \times n$ matrix whose $(i,j)$-entry is equal to…

In this paper, we have studied the distance magic labelling of Generalised Mycielskian of a few families of graphs.

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…

In this article, the distance magic index of certain important classes of partite graphs are determined.

Let $G=(V,E)$ be a graph of order $n$. A closed distance magic labeling of $G$ is a bijection $\ell \colon V(G)\rightarrow \{1,\ldots ,n\}$ for which there exists a positive integer $k$ such that $\sum_{x\in N[v]}\ell (x)=k$ for all $v\in V…

Graph labellings have been a very fruitful area of research in the last four decades. However, despite the staggering number of papers published in the field (over 1000), few general results are available, and most papers deal with…

Assessing the accuracy of the output of causal discovery algorithms is crucial in developing and comparing novel methods. Common evaluation metrics such as the structural Hamming distance are useful for assessing individual links of causal…

The modular product $G\diamond H$ of graphs $G$ and $H$ is a graph on vertex set $V(G)\times V(H)$. Two vertices $(g,h)$ and $(g',h')$ of $G\diamond H$ are adjacent if $g=g'$ and $hh'\in E(H)$, or $gg'\in E(G)$ and $h=h'$, or $gg'\in E(G)$…