Recent Submissions

• Caterpillars are antimagic 

  Lozano Bojados, Antoni; Mora Giné, Mercè; Seara Ojea, Carlos; Tey Carrera, Joaquín (2021-01-21)
  Article
  Restricted access - publisher's policy

  An antimagic labeling of a 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 u is the sum of the labels assigned to the ...
• Reappraising the distribution of the number of edge crossings of graphs on a sphere 

  Alemany Puig, Lluís; Mora Giné, Mercè; Ferrer Cancho, Ramon (Institute of Physics (IOP), 2020-08-01)
  Article
  Restricted access - publisher's policy

  Many real transportation and mobility networks have their vertices placed on the surface of the Earth. In such embeddings, the edges laid on that surface may cross. In his pioneering research, Moon analyzed the distribution ...
• 

  Neighbor-locating colorings in graphs 

  Alcón, Liliana; Gutierrez, Marisa; Hernando Martín, María del Carmen; Mora Giné, Mercè; Pelayo Melero, Ignacio Manuel (2020-02-02)
  Article
  Open Access

  A k-coloring of a graph G is a k-partition of into independent sets, called colors. A k-coloring is called neighbor-locating if for every pair of vertices belonging to the same color , the set of colors of the neighborhood ...