Mostra el registre d'ítem simple
A note on the order of iterated line digraphs
dc.contributor.author | Dalfó Simó, Cristina |
dc.contributor.author | Fiol Mora, Miquel Àngel |
dc.contributor.other | Universitat Politècnica de Catalunya. Departament de Matemàtiques |
dc.date.accessioned | 2016-09-14T12:40:26Z |
dc.date.available | 2017-07-27T00:30:32Z |
dc.date.issued | 2016-07-27 |
dc.identifier.citation | Dalfo, C., Fiol, M. A note on the order of iterated line digraphs. "Journal of graph theory", 2017, vol. 85, núm. 2, p. 395-399. |
dc.identifier.issn | 0364-9024 |
dc.identifier.uri | http://hdl.handle.net/2117/89923 |
dc.description.abstract | Given a digraph G, we propose a new method to find the recurrence equation for the number of vertices n_k of the k-iterated line digraph L_k(G), for k>= 0, where L_0(G) = G. We obtain this result by using the minimal polynomial of a quotient digraph pi(G) of G. We show some examples of this method applied to the so-called cyclic Kautz, the unicyclic, and the acyclic digraphs. In the first case, our method gives the enumeration of the ternary length-2 squarefree words of any length. |
dc.format.extent | 4 p. |
dc.language.iso | eng |
dc.publisher | Wiley |
dc.rights.uri | http://creativecommons.org/licenses/by-nc-nd/3.0/es/ |
dc.subject | Àrees temàtiques de la UPC::Matemàtiques i estadística::Matemàtica discreta::Teoria de grafs |
dc.subject.lcsh | Graph theory |
dc.subject.other | Line digraph |
dc.subject.other | adjacency matrix |
dc.subject.other | minimal polynomial |
dc.subject.other | regular partition |
dc.subject.other | quotient digraph |
dc.subject.other | recurrence |
dc.title | A note on the order of iterated line digraphs |
dc.type | Article |
dc.subject.lemac | Teoria de grafs |
dc.contributor.group | Universitat Politècnica de Catalunya. COMBGRAPH - Combinatòria, Teoria de Grafs i Aplicacions |
dc.identifier.doi | 10.1002/jgt.22068 |
dc.description.peerreviewed | Peer Reviewed |
dc.subject.ams | Classificació AMS::05 Combinatorics::05C Graph theory |
dc.rights.access | Open Access |
local.identifier.drac | 18849130 |
dc.description.version | Postprint (author's final draft) |
dc.relation.projectid | info:eu-repo/grantAgreement/MINECO//MTM2014-60127-P/ES/TECNICAS DE OPTIMIZACION EN TEORIA DE GRAFOS, GRUPOS Y COMBINATORIA. APLICACIONES A REDES, ALGORITMOS Y PROTOCOLOS DE COMUNICACION./ |
local.citation.author | Dalfo, C.; Fiol, M. |
local.citation.publicationName | Journal of graph theory |
local.citation.volume | 85 |
local.citation.number | 2 |
local.citation.startingPage | 395 |
local.citation.endingPage | 399 |
Fitxers d'aquest items
Aquest ítem apareix a les col·leccions següents
-
Articles de revista [3.269]
-
Articles de revista [290]