Antimagic Labeling of Generalized Pyramid Graphs

Result code in IS VaVaI

<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F49777513%3A23520%2F14%3A43921951" target="_blank" >RIV/49777513:23520/14:43921951 - isvavai.cz</a>

Result on the web

<a href="http://dx.doi.org/10.1007/s10114-014-2381-7" target="_blank" >http://dx.doi.org/10.1007/s10114-014-2381-7</a>

DOI - Digital Object Identifier

<a href="http://dx.doi.org/10.1007/s10114-014-2381-7" target="_blank" >10.1007/s10114-014-2381-7</a>

Result language

angličtina

Original language name

Antimagic Labeling of Generalized Pyramid Graphs

Original language description

An antimagic labeling of a graph with q edges is a bijection from the set of edges to the set of positive integers {1,2,...,q} such that all vertex weights are pairwise distinct, where the vertex weight of a vertex is the sum of the labels of all edges incident with that vertex. A graph is antimagic if it has an antimagic labeling. In this paper, we provide antimagic labelings for a family of generalized pyramid 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

2014

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

30

Issue of the periodical within the volume

2

Country of publishing house

CN - CHINA

Number of pages

8

Pages from-to

283-290

UT code for WoS article

—

EID of the result in the Scopus database

—