Intersection Graph - Formal Definition

Formal Definition

Formally, an intersection graph is an undirected graph formed from a family of sets

Si, i = 0, 1, 2, ...

by creating one vertex vi for each set Si, and connecting two vertices vi and vj by an edge whenever the corresponding two sets have a nonempty intersection, that is,

E(G) = {{vi, vj} | SiSj ≠ ∅}.

Read more about this topic:  Intersection Graph

Famous quotes containing the words formal and/or definition:

    The spiritual kinship between Lincoln and Whitman was founded upon their Americanism, their essential Westernism. Whitman had grown up without much formal education; Lincoln had scarcely any education. One had become the notable poet of the day; one the orator of the Gettsyburg Address. It was inevitable that Whitman as a poet should turn with a feeling of kinship to Lincoln, and even without any association or contact feel that Lincoln was his.
    Edgar Lee Masters (1869–1950)

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