Minimal Sum Labeling of Graphs
The result's identifiers
Result code in IS VaVaI
<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F00216208%3A11320%2F18%3A10385825" target="_blank" >RIV/00216208:11320/18:10385825 - isvavai.cz</a>
Result on the web
<a href="https://doi.org/10.1007/978-3-319-78825-8_21" target="_blank" >https://doi.org/10.1007/978-3-319-78825-8_21</a>
DOI - Digital Object Identifier
<a href="http://dx.doi.org/10.1007/978-3-319-78825-8_21" target="_blank" >10.1007/978-3-319-78825-8_21</a>
Alternative languages
Result language
angličtina
Original language name
Minimal Sum Labeling of Graphs
Original language description
A graph G is called a sum graph if there is a so-called sum labeling of G, i.e. an injective function l : V(G) -> N such that for every u, v is an element of V (G) it holds that uv is an element of E(G) if and only if there exists a vertex w is an element of V (G) such that l(u) + l(v) = l(w). We say that sum labeling l is minimal if there is a vertex u is an element of V (G) such that l(u) = 1. In this paper, we show that if we relax the conditions (either allow non-injective labelings or consider graphs with loops) then there are sum graphs without a minimal labeling, which partially answers the question posed by Miller in [6] and [5].
Czech name
—
Czech description
—
Classification
Type
D - Article in proceedings
CEP classification
—
OECD FORD branch
10201 - Computer sciences, information science, bioinformathics (hardware development to be 2.2, social aspect to be 5.8)
Result continuities
Project
<a href="/en/project/GBP202%2F12%2FG061" target="_blank" >GBP202/12/G061: Center of excellence - Institute for theoretical computer science (CE-ITI)</a><br>
Continuities
P - Projekt vyzkumu a vyvoje financovany z verejnych zdroju (s odkazem do CEP)
Others
Publication year
2018
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
Article name in the collection
COMBINATORIAL ALGORITHMS, IWOCA 2017
ISBN
978-3-319-78824-1
ISSN
0302-9743
e-ISSN
1611-3349
Number of pages
12
Pages from-to
252-263
Publisher name
SPRINGER INTERNATIONAL PUBLISHING AG
Place of publication
CHAM
Event location
Newcastle
Event date
Jul 17, 2017
Type of event by nationality
WRD - Celosvětová akce
UT code for WoS article
000445803300021