Strong Product Of Graphs
In graph theory, the strong product G ⊠ H of graphs G and H is a graph such that
- the vertex set of G ⊠ H is the Cartesian product V(G) × V(H); and
- any two distinct vertices (u,u') and (v,v') are adjacent in G × H if and only if u' is adjacent with v' or u'=v', and u is adjacent with v or u = v.
The strong product is also called the normal product and AND product. It was first introduced by Sabidussi in 1960. László Lovász showed that Lovász theta function is multiplicative:
Read more about Strong Product Of Graphs: See Also
Famous quotes containing the words strong and/or product:
“They reckon ill who leave me out;
When me they fly, I am the wings;
I am the doubter and the doubt,
And I the hymn the Brahmin sings.
The strong gods pine for my abode,
And pine in vain the sacred Seven;
But thou, meek lover of the good!
Find me, and turn thy back on heaven.”
—Ralph Waldo Emerson (1803–1882)
“Whenever a taboo is broken, something good happens, something vitalizing.... Taboos after all are only hangovers, the product of diseased minds, you might say, of fearsome people who hadn’t the courage to live and who under the guise of morality and religion have imposed these things upon us.”
—Henry Miller (1891–1980)