Graph labeling

Known as: Lucky labeling, Edge labeled graph, Vertex labeled graph 
In the mathematical discipline of graph theory, a graph labeling is the assignment of labels, traditionally represented by integers, to the edges or… (More)
Wikipedia

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2008
2008
The problem of deciding whether two graphs are isomorphic is fundamental in graph theory. Moreover, the flexibility with which… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
2007
2007
An anti-magic labeling of a finite simple undirected graph with p vertices and q edges is a bijection from the set of edges to… (More)
  • figure 2
  • figure 1
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
Highly Cited
2003
Highly Cited
2003
Recent stereo algorithms have achieved impressive results by modelling the disparity image as a Markov Random Field (MRF). An… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
Highly Cited
2003
Highly Cited
2003
This paper proposes a similarity measure to compare cases represented by labeled graphs. We first define an expressive model of… (More)
  • figure 1
  • figure 2
  • figure 4
Is this relevant?
1999
1999
Combinations of graph drawing and map labeling problems yield challenging mathematical problems and have direct applications, e.g… (More)
  • figure 4
Is this relevant?
Highly Cited
1998
Highly Cited
1998
The vertex-labeling of graphs with nonnegative integers provides a natural setting in which to study problems of radio channel… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
1997
1997
This paper deals with the problem of motion-based segmentation of image sequences. Such partitions are multiple-purpose in… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
Review
1996
Review
1996
A graph labeling is an assignment of integers to the vertices or edges, or both, subject to certain conditions. Graph labelings… (More)
  • table 2
  • table 2
  • table 2
Is this relevant?
Highly Cited
1988
Highly Cited
1988
-A model for position invariant pattern recognition is presented. Although not demonstrated here, the system is insensitive to… (More)
  • table 1
Is this relevant?
1974
1974
Two efficient computer implemented algorithms are presented -=. :'or explicitly constructing all distinct labelings of a graph G… (More)
  • figure 1
Is this relevant?