Covering Graph - Definition

Definition

Let G = (V, E) and C = (V2, E2) be two graphs, and let f: V2V be a surjection. Then f is a covering map from C to G if for each vV2, the restriction of f to the neighbourhood of v is a bijection onto the neighbourhood of f(v) ∈ V in G. Put otherwise, f maps edges incident to v one-to-one onto edges incident to f(v).

If there exists a covering map from C to G, then C is a covering graph, or a lift, of G. An h-lift is a lift such that the covering map f has the property that for every vertex v of G, its fiber f-1(v) has exactly h elements.

Read more about this topic:  Covering Graph

Famous quotes containing the word definition:

    It is very hard to give a just definition of love. The most we can say of it is this: that in the soul, it is a desire to rule; in the spirit, it is a sympathy; and in the body, it is but a hidden and subtle desire to possess—after many mysteries—what one loves.
    François, Duc De La Rochefoucauld (1613–1680)

    Was man made stupid to see his own stupidity?
    Is God by definition indifferent, beyond us all?
    Is the eternal truth man’s fighting soul
    Wherein the Beast ravens in its own avidity?
    Richard Eberhart (b. 1904)

    One definition of man is “an intelligence served by organs.”
    Ralph Waldo Emerson (1803–1882)