On a Relationship between Completely Separating Systems and Antimagic Labeling of Regular Graphs
The result's identifiers
Result code in IS VaVaI
<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F49777513%3A23520%2F11%3A43897066" target="_blank" >RIV/49777513:23520/11:43897066 - isvavai.cz</a>
Result on the web
—
DOI - Digital Object Identifier
—
Alternative languages
Result language
angličtina
Original language name
On a Relationship between Completely Separating Systems and Antimagic Labeling of Regular Graphs
Original language description
In this paper we show that there is a relationship between completely separating systems on a finite set and antimagic labeling of graphs. Using this relationship we prove the antimagicness of various families of regular graphs.
Czech name
—
Czech description
—
Classification
Type
J<sub>x</sub> - Unclassified - Peer-reviewed scientific article (Jimp, Jsc and Jost)
CEP classification
IN - Informatics
OECD FORD branch
—
Result continuities
Project
—
Continuities
I - Institucionalni podpora na dlouhodoby koncepcni rozvoj vyzkumne organizace
Others
Publication year
2011
Confidentiality
S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů
Data specific for result type
Name of the periodical
Lecture Notes in Computer Science
ISSN
0302-9743
e-ISSN
—
Volume of the periodical
6460
Issue of the periodical within the volume
—
Country of publishing house
DE - GERMANY
Number of pages
4
Pages from-to
238-241
UT code for WoS article
000290418700024
EID of the result in the Scopus database
—