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:

    On every formal visit a child ought to be of the party, by way of provision for discourse.
    Jane Austen (1775–1817)

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