Sökning: "distance-consistence"
Hittade 1 uppsats innehållade ordet distance-consistence.
1. Distance Consistent Labellings and the Local List Number
Kandidat-uppsats, Linköpings universitet/Algebra, geometri och diskret matematik; Linköpings universitet/Tekniska fakultetenSammanfattning : We study the local list number of graphs introduced by Lennerstad and Eriksson. A labelling of a graph on n vertices is a bijection from vertex set to the set {1,…, n}. Given such a labelling c a vertex u is distance consistent if for all vertices v and w |c(u)-c(v)|=|c(u)-c(w)|+1 implies d(u,w)≤ d(u,v). LÄS MER
Resultatsidor:
1