Distance magic Cartesian product of graphs

Sylwia Cichacz; Dalibor Fronček; Elliot Krop; Christopher Raridan

doi:10.7151/dmgt.1852

ScienceGate Book Chapters

JOURNAL ARTICLE

Distance magic Cartesian product of graphs

Sylwia Cichacz Dalibor Fronček Elliot Krop Christopher Raridan

Year: 2015 Journal: Discussiones Mathematicae Graph Theory Vol: 36 (2)Pages: 299-299 Publisher: De Gruyter Open

DOI: 10.7151/dmgt.1852

Get Full-Text PDF Get Analytical Report

Abstract

A distance magic labeling of a graph G = (V,E) with |V | = n is a bijection ℓ : V → {1, . . . , n} such that the weight of every vertex v, computed as the sum of the labels on the vertices in the open neighborhood of v, is a constant.

Keywords:

Cartesian product Mathematics Combinatorics MAGIC (telescope) Product (mathematics) Discrete mathematics Geometry Physics Astronomy

Metrics

Cited By

0.65

FWCI (Field Weighted Citation Impact)

Refs

0.78

Citation Normalized Percentile

Is in top 1%

Is in top 10%

Citation History

Topics

Graph Labeling and Dimension Problems

Physical Sciences → Computer Science → Computational Theory and Mathematics

graph theory and CDMA systems

Physical Sciences → Engineering → Electrical and Electronic Engineering

Graph theory and applications

Physical Sciences → Mathematics → Geometry and Topology

Distance magic Cartesian product of graphs

Abstract

Metrics

Citation History

Topics

Related Documents

The distance magic property and two families of Cartesian product graphs

Anti-magic labelling of Cartesian product of graphs

Distance degree graphs in the Cartesian product of graphs

Group distance magic Cartesian product of two cycles

Distance antimagic labelings of Cartesian product of graphs