Additive edge labelings

Let G = (V, E) be a graph and d a positive integer. We study the following problem: for which labelings fE : E → Zd is there a labeling fV : V → Zd such that fE (i, j) = fV (i) + fV (j) (mod d), for every edge (i, j) ∈ E? We also explore the connections of the equivalent multiplicative version to to...

Descripción completa

Guardado en:
Detalles Bibliográficos
Autores principales: Dickenstein, Alicia Marcela, Tobis, Enrique Augusto
Publicado: 2010
Materias:
Cycles
Graph labeling
Incidence matrix
Kernel
Toric ideal
Following problem
Graph labelings
Incidence matrices
Labelings
Multiplicative version
Polynomial algorithm
Positive integers
Possible solutions
Toric ideals
Labeling
Acceso en línea:https://bibliotecadigital.exactas.uba.ar/collection/paper/document/paper_0166218X_v158_n5_p444_Dickenstein
http://hdl.handle.net/20.500.12110/paper_0166218X_v158_n5_p444_Dickenstein
Aporte de:
Biblioteca Digital - Facultad de Ciencias Exactas y Naturales (UBA) de Universidad de Buenos Aires

Ejemplares similares

Ejemplares similares