labelled graph

References

labelled graph

mathematics

Written by

The Information Architects of Encyclopaedia Britannica

Learn about this topic in these articles:

combinatorics
Definitions
A graph G is labelled when the various υ vertices are distinguished by such names as x₁, x₂, · · · x_υ. Two graphs G and H are said to be isomorphic (written G ≃ H) if there exists a one–one correspondence between their vertex sets that preserves adjacency.…
Read More
A graph G is labelled when the various υ vertices are distinguished by such names as x₁, x₂, · · · x_υ. Two graphs G and H are said to be isomorphic (written G ≃ H) if there exists a one–one correspondence between their vertex sets that preserves adjacency.…
Read More