Approximate results for rainbow labelings

A simple graph G = ( V , E ) is said to be antimagic if there exists a bijection f : E → [ 1 , | E | ] such that the sum of the values of f on edges incident to a vertex takes different values on distinct vertices. The graph G is distance antimagic if there exists a bijection f : V → [ 1 , | V | ] ,...

Full description

Saved in:

Bibliographic Details
Published in:	Periodica mathematica Hungarica Vol. 74; no. 1; pp. 11 - 21
Main Authors:	Lladó, Anna, Miller, Mirka
Format:	Journal Article Publication
Language:	English
Published:	Dordrecht Springer Netherlands 01.03.2017 Springer Nature B.V
Subjects:	05 Combinatorics 05C Graph theory 11 Number theory 11C Polynomials and matrices Classificació AMS Combinatòria Decision trees Grafs, Teoria de Graph labeling Graph theory Leaves Matemàtica discreta Matemàtiques i estadística Mathematics Mathematics and Statistics Polinomis Polynomial method Polynomials Teoria de nombres Trees (mathematics) Àlgebra Àrees temàtiques de la UPC Graph labeling Polynomial method
ISSN:	0031-5303, 1588-2829
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!

Be the first to leave a comment!