On d-antimagic labelings of plane graphs

Martin Baca; Ljiljana Brankovic; Marcela Lascsakova; Oudone Phanalasy; Andrea Semanicova–Fenovcıkova

doi:10.5614/ejgta.2013.1.1.3

On d-antimagic labelings of plane graphs

Martin Baca, Ljiljana Brankovic, Marcela Lascsakova, Oudone Phanalasy, Andrea Semanicova–Fenovcıkova

Computer Science

Research output: Contribution to journal › Article › peer-review

Abstract

The paper deals with the problem of labeling the vertices and edges of a plane graph in such a way that the labels of the vertices and edges surrounding that face add up to a weight of that face. A labeling of a plane graph is called d-antimagic if for every positive integer s, the s-sided face weights form an arithmetic progression with a difference d. Such a labeling is called super if the smallest possible labels appear on the vertices.

In the paper we examine the existence of such labelings for several families of plane graphs.

Original language	English
Pages (from-to)	28-39
Journal	Electronic Journal of Graph Theory and Applications
Volume	1
Issue number	1
DOIs	https://doi.org/10.5614/ejgta.2013.1.1.3
Publication status	Published - 31 Dec 2013

Access to Document

10.5614/ejgta.2013.1.1.3

https://hdl.handle.net/1959.11/62053

Handle.net

Persistent link

Cite this

@article{e3e9118386c143b988f0f86f92ee2d76,

title = "On d-antimagic labelings of plane graphs",

abstract = "The paper deals with the problem of labeling the vertices and edges of a plane graph in such a way that the labels of the vertices and edges surrounding that face add up to a weight of that face. A labeling of a plane graph is called d-antimagic if for every positive integer s, the s-sided face weights form an arithmetic progression with a difference d. Such a labeling is called super if the smallest possible labels appear on the vertices. In the paper we examine the existence of such labelings for several families of plane graphs.",

author = "Martin Baca and Ljiljana Brankovic and Marcela Lascsakova and Oudone Phanalasy and Andrea Semanicova–Fenovcıkova",

year = "2013",

month = dec,

day = "31",

doi = "10.5614/ejgta.2013.1.1.3",

language = "English",

volume = "1",

pages = "28--39",

journal = "Electronic Journal of Graph Theory and Applications",

issn = "2338-2287",

publisher = "Institut Teknologi Nasional Bandung",

number = "1",

}

TY - JOUR

T1 - On d-antimagic labelings of plane graphs

AU - Baca, Martin

AU - Brankovic, Ljiljana

AU - Lascsakova, Marcela

AU - Phanalasy, Oudone

AU - Semanicova–Fenovcıkova, Andrea

PY - 2013/12/31

Y1 - 2013/12/31

N2 - The paper deals with the problem of labeling the vertices and edges of a plane graph in such a way that the labels of the vertices and edges surrounding that face add up to a weight of that face. A labeling of a plane graph is called d-antimagic if for every positive integer s, the s-sided face weights form an arithmetic progression with a difference d. Such a labeling is called super if the smallest possible labels appear on the vertices. In the paper we examine the existence of such labelings for several families of plane graphs.

AB - The paper deals with the problem of labeling the vertices and edges of a plane graph in such a way that the labels of the vertices and edges surrounding that face add up to a weight of that face. A labeling of a plane graph is called d-antimagic if for every positive integer s, the s-sided face weights form an arithmetic progression with a difference d. Such a labeling is called super if the smallest possible labels appear on the vertices. In the paper we examine the existence of such labelings for several families of plane graphs.

U2 - 10.5614/ejgta.2013.1.1.3

DO - 10.5614/ejgta.2013.1.1.3

M3 - Article

SN - 2338-2287

VL - 1

SP - 28

EP - 39

JO - Electronic Journal of Graph Theory and Applications

JF - Electronic Journal of Graph Theory and Applications

IS - 1

ER -

On d-antimagic labelings of plane graphs

Abstract

Access to Document

Handle.net

Fingerprint

Cite this