Super d-antimagic labeling of disconnected plane graphs

Result code in IS VaVaI

<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F49777513%3A23520%2F10%3A00504074" target="_blank" >RIV/49777513:23520/10:00504074 - isvavai.cz</a>

Result on the web

—

DOI - Digital Object Identifier

—

Result language

angličtina

Original language name

Super d-antimagic labeling of disconnected plane graphs

Original language description

This paper deals with the problem of labeling the vertices, edges and faces of a plane graph in such a way that the label of a face and the labels of the vertices and edges surrounding that face add up to a weight of that face, and the weights of all s-sided faces constitute an arithmetic progression of difference d, for each s that appears in the graph. The paper examines the existence of such labelings for disjoint union of plane graphs.

Czech name

—

Czech description

—

Type

J_x - Unclassified - Peer-reviewed scientific article (Jimp, Jsc and Jost)

CEP classification

BA - General mathematics

OECD FORD branch

—

Project

—

Continuities

I - Institucionalni podpora na dlouhodoby koncepcni rozvoj vyzkumne organizace

Publication year

2010

Confidentiality

S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů

Name of the periodical

Acta Mathematica Sinica, English Series

ISSN

1439-8516

e-ISSN

—

Volume of the periodical

26

Issue of the periodical within the volume

12

Country of publishing house

DE - GERMANY

Number of pages

12

Pages from-to

—

UT code for WoS article

—

EID of the result in the Scopus database

—