Mostra el registre d'ítem simple
Queen Labelings
dc.contributor.author | Bloom, Gary |
dc.contributor.author | Lampis, Michael |
dc.contributor.author | Muntaner Batle, Francesc Antoni |
dc.contributor.author | Rius Font, Miquel |
dc.contributor.other | Universitat Politècnica de Catalunya. Departament de Matemàtica Aplicada IV |
dc.date.accessioned | 2009-03-16T16:58:36Z |
dc.date.available | 2009-03-16T16:58:36Z |
dc.date.issued | 2008 |
dc.identifier.uri | http://hdl.handle.net/2117/2784 |
dc.description.abstract | We introduce and investigate the concept of Queen labeling a digraph and its connection to the well-known n-queens problem. In the general case we obtain an upper bound on the size of a queen graph and show that it is tight. We also examine the existence of possible forbid-den subgraphs for this problem and show that only two such subgraphs exist. Then we focus on specific graph families: First we show that every star is a queen graph by giving an algorithm for which we prove cor-rectness. Then we show that the problem of queen labeling a matching is equivalent to a variation of the n-queens problem, which we call the rooks-and-queens problem and we use that fact to give a short proof that every matching is a queen graph. Finally, for unions of 3-cycles we give a general solution of the problem for graphs of n(n - 1) vertices. |
dc.format.extent | 10 p. |
dc.language.iso | eng |
dc.subject | Àrees temàtiques de la UPC::Matemàtiques i estadística |
dc.subject.lcsh | Graph labelings |
dc.subject.other | Labeling |
dc.title | Queen Labelings |
dc.type | Article |
dc.subject.lemac | Grafs, Teoria de |
dc.contributor.group | Universitat Politècnica de Catalunya. COMBGRAPH - Combinatòria, Teoria de Grafs i Aplicacions |
dc.subject.ams | Classificació AMS::05 Combinatorics::05C Graph theory |
dc.rights.access | Open Access |
dc.relation.projectidctt | MTM2008-06620-C03-01/MTM |
local.personalitzacitacio | true |
Fitxers d'aquest items
Aquest ítem apareix a les col·leccions següents
-
Articles de revista [3.269]
-
Articles de revista [290]