Show simple item record

dc.contributor.authorDalfó, Cristina
dc.contributor.authorFiol, Miguel Angel
dc.date.accessioned2021-12-15T09:19:51Z
dc.date.available2021-12-15T09:19:51Z
dc.date.issued2016-06
dc.identifier.issn0364-9024
dc.identifier.urihttp://hdl.handle.net/10459.1/72560
dc.description.abstractGiven a digraph G, we propose a new method to find therecurrence equation for the number of vertices nk of the k-iterated linedigraph Lk(G), for k≥0, where L0(G)=G. We obtain this result by usingthe minimal polynomial of a quotient digraph π(G) of Gca_ES
dc.description.sponsorshipThis research is supported by the Ministerio de Economía y Competitividad and the European Regional Development Fund under project MTM2014-60127-P, and the Catalan Research Council under project 2014SGR1147.ca_ES
dc.language.isoengca_ES
dc.publisherWiley Periodicals Inc.ca_ES
dc.relationinfo: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/ca_ES
dc.relation.isformatofversió postprint del document publicat a: https://doi.org/10.1002/jgt.22068ca_ES
dc.relation.ispartofJournal of graph theory, 2017, vol. 85, núm. 2, p. 395-399ca_ES
dc.rights(c) Wiley Periodicals, Inc., 2016ca_ES
dc.subjectLine digraphca_ES
dc.subjectAdjacency matrixca_ES
dc.subjectMinimal polynomiaca_ES
dc.subjectRegular partitionca_ES
dc.subjectQuotient digraphca_ES
dc.subjectRecurrenceca_ES
dc.titleA note on the order of iterated line digraphsca_ES
dc.typeinfo:eu-repo/semantics/articleca_ES
dc.identifier.idgrec028001
dc.type.versioninfo:eu-repo/semantics/acceptedVersionca_ES
dc.rights.accessRightsinfo:eu-repo/semantics/openAccessca_ES
dc.identifier.doihttps://doi.org/10.1002/jgt.22068


Files in this item

Thumbnail

This item appears in the following Collection(s)

Show simple item record