Enumerating super edge-magic labelings for some types of path-like  trees

All of RECERCAT

To access the full text documents, please follow this link: http://hdl.handle.net/2117/7493

dc.contributor	Universitat Politècnica de Catalunya. Departament de Matemàtica Aplicada IV
dc.contributor	Universitat Politècnica de Catalunya. COMBGRAPH - Combinatòria, Teoria de Grafs i Aplicacions
dc.contributor.author	López Masip, Susana Clara
dc.contributor.author	Muntaner Batle, Francesc Antoni
dc.contributor.author	Rius Font, Miquel
dc.date	2010-06-02
dc.identifier.uri	http://hdl.handle.net/2117/7493
dc.language.iso	eng
dc.rights	Attribution-NonCommercial-NoDerivs 3.0 Spain
dc.rights	info:eu-repo/semantics/openAccess
dc.rights	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	Computer science--Mathematics
dc.subject	Graph labelings
dc.subject	Grafs, Teoria de
dc.subject	Matemàtica
dc.title	Enumerating super edge-magic labelings for some types of path-like trees
dc.type	info:eu-repo/semantics/publishedVersion
dc.type	info:eu-repo/semantics/article
dc.description.abstract	The main goal of this paper is to use a variation of the Kronecker product of matrices in order to obtain lower bounds for the number of non isomorphic super edge-magic labelings of some types of path-like trees. As a corollary of the results obtained here we also obtain lower bounds for the number of harmonious labelings of the same type of trees.