Mostra el registre d'ítem simple

dc.contributor.authorLópez Masip, Susana Clara
dc.contributor.otherUniversitat Politècnica de Catalunya. Departament de Matemàtiques
dc.date.accessioned2017-12-11T13:09:06Z
dc.date.available2018-12-01T01:31:21Z
dc.date.issued2017-07
dc.identifier.citationLópez, S.C. (Di)graph products, labelings and related results. "Electronic notes in discrete mathematics", Juliol 2017, vol. 60, p. 55-60.
dc.identifier.issn1571-0653
dc.identifier.urihttp://hdl.handle.net/2117/111692
dc.description.abstractGallian's survey shows that there is a big variety of labelings of graphs. By means of (di)graphs products we can establish strong relations among some of them. Moreover, due to the freedom of one of the factors, we can also obtain enumerative results that provide lower bounds on the number of nonisomorphic labelings of a particular type. In this paper, we will focus in three of the (di)graphs products that have been used in these duties: the ¿h-product of digraphs, the weak tensor product of graphs and the weak ¿h-product of graphs.
dc.format.extent6 p.
dc.language.isoeng
dc.rightsAttribution-NonCommercial-NoDerivs 3.0 Spain
dc.rights.urihttp://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
dc.subject.lcshComputer science--Mathematics
dc.subject.other¿h-product
dc.subject.otherweak tensor product of graphs
dc.subject.otherweak ¿h-product
dc.subject.other(super) edge-magic
dc.subject.othera-labeling
dc.title(Di)graph products, labelings and related results
dc.typeArticle
dc.subject.lemacInformàtica -- Matemàtica
dc.contributor.groupUniversitat Politècnica de Catalunya. COMBGRAPH - Combinatòria, Teoria de Grafs i Aplicacions
dc.identifier.doi10.1016/j.endm.2017.06.008
dc.relation.publisherversionhttp://www.sciencedirect.com/science/article/pii/S1571065317300938
dc.rights.accessOpen Access
local.identifier.drac21162806
dc.description.versionPostprint (updated version)
dc.relation.projectidinfo: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.authorLópez, S.C.
local.citation.publicationNameElectronic notes in discrete mathematics
local.citation.volume60
local.citation.startingPage55
local.citation.endingPage60


Fitxers d'aquest items

Thumbnail

Aquest ítem apareix a les col·leccions següents

Mostra el registre d'ítem simple