Login / Signup

Strong vertex-magic and edge-magic labelings of 2-regular graphs of odd order using Kotzig completion.

Dan McQuillanJames M. McQuillan
Published in: Discret. Math. (2018)
Keyphrases
  • edge detection
  • undirected graph
  • multiscale
  • weighted graph
  • database
  • real time
  • decision trees
  • graph cuts