Currently displaying 1 – 2 of 2

Showing per page

Order by Relevance | Title | Year of publication

Supermagic Graphs Having a Saturated Vertex

Jaroslav Ivančo;  Tatiana Polláková — 2014

Discussiones Mathematicae Graph Theory

A graph is called supermagic if it admits a labeling of the edges by pairwise different consecutive integers such that the sum of the labels of the edges incident with a vertex is independent of the particular vertex. In this paper we establish some conditions for graphs with a saturated vertex to be supermagic. Inter alia we show that complete multipartite graphs K1,n,n and K1,2,...,2 are supermagic.

On magic joins of graphs

Jaroslav Ivančo;  Tatiana Polláková — 2012

Mathematica Bohemica

A graph is called magic (supermagic) if it admits a labeling of the edges by pairwise different (and consecutive) integers such that the sum of the labels of the edges incident with a vertex is independent of the particular vertex. In this paper we characterize magic joins of graphs and we establish some conditions for magic joins of graphs to be supermagic.

Page 1

Download Results (CSV)