Adjoint digraph

Материал из WikiGrapp
Перейти к:навигация, поиск

Adjoint digraphсопряженный орграф.

The adjoint digraph is defined as a graph, that is, the one whose arcs are exactly the converses for those of \,G. The adjacency operator A(G^{\ast}) of G^{\ast} is the adjoint operator A(G)^{\ast}. Though G^{\ast} is called the converse digraph of \,G among graph theorists, the term adjoint is often used in this sense.

The coadjoint graphs are graphs \,G and G^{\ast} satisfying G \cong G^{\ast}.