Congruence distance magic graphs

02/11/2023
by   Himadri Mukherjee, et al.
0

In this paper, we introduce a series of necessary conditions namely the concept of p-distance magic labeling and give a relation between labeling and graph-theoretic properties of a graph. We also prove that a graph which is p-distance magic, for all p is also distance magic. As a result we have a new necessary and sufficient condition for a distance magic graph. We also obtain conditions for when the “group distance magic constant will be unique".

READ FULL TEXT

page 1

page 2

page 3

page 4

research
08/31/2017

Distances between bicliques and structural properties of bicliques in graphs

A biclique is a maximal bipartite complete induced subgraph of G. The bi...
research
06/13/2019

Link Dimension and Exact Construction of a Graph

Minimum resolution set and associated metric dimension provide the basis...
research
11/11/2013

Notes on Elementary Spectral Graph Theory. Applications to Graph Clustering Using Normalized Cuts

These are notes on the method of normalized graph cuts and its applicati...
research
11/02/2021

Graph Tree Deductive Networks

In this paper, we introduce Graph Tree Deductive Networks, a network tha...
research
05/24/2018

Modular Decomposition of Graphs and the Distance Preserving Property

Given a graph G, a subgraph H is isometric if d_H(u,v) = d_G(u,v) for ev...
research
07/21/2013

An Information Theoretic Measure of Judea Pearl's Identifiability and Causal Influence

In this paper, we define a new information theoretic measure that we cal...
research
05/09/2022

New Results on Pairwise Compatibility Graphs

A graph G=(V,E) is called a pairwise compatibility graph (PCG) if there ...

Please sign up or login with your details

Forgot password? Click here to reset