Antimagic labeling of disjoint union of s-crowns

Result code in IS VaVaI

<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F49777513%3A23520%2F09%3A00503070" target="_blank" >RIV/49777513:23520/09:00503070 - isvavai.cz</a>

Result on the web

—

DOI - Digital Object Identifier

—

Result language

angličtina

Original language name

Antimagic labeling of disjoint union of s-crowns

Original language description

A graph G of order p and size q is called (a,d)-edge-antimagic total if there exists a bijection f : of the set of vertices and edges onto {1, 2, ..., p + q} such that the edge-weights, w(uv) = f(u) + f(v) + f(uv) form an arithmetic sequence with first term a and common difference d. Such a graph G is called super if the smallest possible labels appear on the vertices. In this paper we study super (a,d)-edge-antimagic total properties of disconnected graphs consisting of s-crowns, paths and cycles.

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

S - Specificky vyzkum na vysokych skolach

Publication year

2009

Confidentiality

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

Name of the periodical

Utilitas Mathematica

ISSN

0315-3681

e-ISSN

—

Volume of the periodical

79

Issue of the periodical within the volume

1

Country of publishing house

CA - CANADA

Number of pages

13

Pages from-to

—

UT code for WoS article

—

EID of the result in the Scopus database

—