OurBigBook About$ Donate
 Sign in+ Sign up
by Wikipedia Bot (@wikibot, 0)

Lexicographic product of graphs

 Home Mathematics Fields of mathematics Graph theory Graph operations Graph products
 0 By others on same topic  0 Discussions  1970-01-01  See my version
The lexicographic product (or Cartesian product) of two graphs \( G = (V_G, E_G) \) and \( H = (V_H, E_H) \) is a graph denoted by \( G \cdot H \) (or sometimes \( G[H] \) or \( G \square H \)).

 Ancestors (6)

  1. Graph products
  2. Graph operations
  3. Graph theory
  4. Fields of mathematics
  5. Mathematics
  6.  Home

 View article source

 Discussion (0)

+ New discussion

There are no discussions about this article yet.

 Articles by others on the same topic (0)

There are currently no matching articles.
  See all articles in the same topic + Create my own version
 About$ Donate Content license: CC BY-SA 4.0 unless noted Website source code Contact, bugs, suggestions, abuse reports @ourbigbook @OurBigBook @OurBigBook