Trees whose even-degree vertices induce a path are antimagic

Autor: Lozano Bojados, Antoni, Mora Giné, Mercè, Seara Ojea, Carlos, Tey Carrera, Joaquín

Publikováno v: UPCommons. Portal del coneixement obert de la UPC
Universitat Politècnica de Catalunya (UPC)
Recercat. Dipósit de la Recerca de Catalunya
instname

An antimagic labeling of a connected graph G is a bijection from the set of edges E(G) to {1, 2, . . . , |E(G)|} such that all vertex sums are pairwise distinct, where the vertex sum at vertex v is the sum of the labels assigned to edges incident to

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=dedup_wf_001::369c56918dc8a20c57cb110ec012ff52
http://hdl.handle.net/2117/133369