Mostra el registre d'ítem simple
Defensive alliances in regular graphs and circulant graphs
dc.contributor.author | Araujo Pardo, M. Gabriela |
dc.contributor.author | Barrière Figueroa, Eulalia |
dc.contributor.other | Universitat Politècnica de Catalunya. Departament de Matemàtica Aplicada IV |
dc.date.accessioned | 2008-10-08T13:13:57Z |
dc.date.available | 2008-10-08T13:13:57Z |
dc.date.issued | 2008-10 |
dc.identifier.uri | http://hdl.handle.net/2117/2284 |
dc.description.abstract | In this paper we study defensive alliances in some regular graphs. We determine which subgraphs could a critical defensive alliance of a graph $G$ induce, if $G$ is $6$-regular and the cardinality of the alliance is at most $8$. In particular, we study the case of circulant graphs, i.e. Cayley graphs on a cyclic group. The critical defensive alliances of a circulant graph of degree at most $6$ are completely determined. For the general case, we give tight lower and upper bounds on the alliance number of a circulant graph with $d$ generators. |
dc.format.extent | 21 p. |
dc.language.iso | eng |
dc.rights | Attribution-NonCommercial-NoDerivs 2.5 Spain |
dc.rights.uri | http://creativecommons.org/licenses/by-nc-nd/2.5/es/ |
dc.subject.lcsh | Graph theory |
dc.subject.other | alliance |
dc.subject.other | induced subgraph |
dc.title | Defensive alliances in regular graphs and circulant graphs |
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.description.version | Preprint |
dc.relation.projectidctt | MTM2005-08990-C02-01 |
dc.relation.projectidctt | TEC2005-03575 |
dc.relation.projectidctt | 2005SGR00256 |
local.personalitzacitacio | true |
Fitxers d'aquest items
Aquest ítem apareix a les col·leccions següents
-
Articles de revista [3.268]
-
Articles de revista [290]