Show simple item record

dc.contributor.authorKovář, Petr
dc.contributor.authorKravčenko, Michal
dc.contributor.authorKrbeček, Matěj
dc.contributor.authorSilber, Adam
dc.date.accessioned2017-11-28T07:34:10Z
dc.date.available2017-11-28T07:34:10Z
dc.date.issued2017
dc.identifier.citationAdvances in electrical and electronic engineering. 2017, vol. 15, no. 2, p. 331-335cs
dc.identifier.issn1336-1376
dc.identifier.issn1804-3119
dc.identifier.urihttp://hdl.handle.net/10084/121833
dc.description.abstractLet G be a simple graph, let f : V(G)→{1,2,...,|V(G)|} be a bijective mapping. The weight of v ∈ V(G) is the sum of labels of all vertices adjacent to v. We say that f is a distance magic labeling of G if the weight of every vertex is the same constant k and we say that f is a handicap magic labeling of G if the weight of every vertex v is l + f(v) for some constant l. Graphs that allow such labelings are called distance magic or handicap, respectively. Distance magic and handicap labelings of regular graphs are used for scheduling incomplete tournaments. While distance magic labelings correspond to so called equalized tournaments, handicap labelings can be used to schedule incomplete tournaments that are more challenging to stronger teams or players, hence they increase competition and yield attractive schemes in which every games counts. We summarize known results on distance magic and handicap labelings and construct a new infinite class of 4-regular handicap graphs.cs
dc.format.extent363986 bytes
dc.format.mimetypeapplication/pdf
dc.languageNeuvedenocs
dc.language.isoencs
dc.publisherVysoká škola báňská - Technická univerzita Ostravacs
dc.relation.ispartofseriesAdvances in electrical and electronic engineeringcs
dc.relation.urihttp://dx.doi.org/10.15598/aeee.v15i2.2263
dc.rights.urihttp://creativecommons.org/licenses/by/4.0/*
dc.subjectschedulingcs
dc.subjecttournamentcs
dc.subjectregular graphcs
dc.subjecthandicap labelingcs
dc.titleHandicap labelings of 4-regular graphscs
dc.typearticlecs
dc.identifier.doi10.15598/aeee.v15i2.2263
dc.rights.accessopenAccess
dc.type.versionpublishedVersion
dc.type.statusPeer-reviewed
dc.identifier.wos000409044400025


Files in this item

This item appears in the following Collection(s)

Show simple item record

http://creativecommons.org/licenses/by/4.0/
Except where otherwise noted, this item's license is described as http://creativecommons.org/licenses/by/4.0/