d-Lucky Labeling of Graphs

Result code in IS VaVaI
<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F49777513%3A23520%2F15%3A43925863" target="_blank" >RIV/49777513:23520/15:43925863 - isvavai.cz</a>
Result on the web
<a href="http://www.sciencedirect.com/science/article/pii/S1877050915020025" target="_blank" >http://www.sciencedirect.com/science/article/pii/S1877050915020025</a>
DOI - Digital Object Identifier
<a href="http://dx.doi.org/10.1016/j.procs.2015.07.473" target="_blank" >10.1016/j.procs.2015.07.473</a>

Result language
angličtina
Original language name
d-Lucky Labeling of Graphs
Original language description
In this paper we introduce a new labeling called d-lucky labeling and study the same as a vertex coloring problem. The d-lucky number of G, is the least positive k such that G has a d-lucky labelling. We obtain exact values of the d-lucky number for hypercube network, butterfly network, benes network, mesh network, hypertree and X-tree.
Czech name
—
Czech description
—

Type
J<sub>x</sub> - Unclassified - Peer-reviewed scientific article (Jimp, Jsc and Jost)
CEP classification
BA - General mathematics
OECD FORD branch
—

Project
<a href="/en/project/ED1.1.00%2F02.0090" target="_blank" >ED1.1.00/02.0090: NTIS - New Technologies for Information Society</a><br>
Continuities
P - Projekt vyzkumu a vyvoje financovany z verejnych zdroju (s odkazem do CEP)<br>I - Institucionalni podpora na dlouhodoby koncepcni rozvoj vyzkumne organizace

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

Similar results(10)