Application of the combinatorial nullstellensatz to integer-magic graph labelings

HIGHLIGHTS

  • who: Richard M. Low and Dan Roberts from the from Illinois Wesleyan UniversityPart of this work was conducted while visiting the during a have published the research: Application of the Combinatorial Nullstellensatz to Integer-magic Graph Labelings, in the Journal: (JOURNAL)
  • what: The authors focus on Z3 -magic and give some results for various classes of graphs.

SUMMARY

    If there uv∈E(G) exists an edge labeling f whose induced mapping f + on V (G) is a constant map, the authors say that f is an A-magic labeling of G . . .

     

    Logo ScioWire Beta black

    If you want to have access to all the content you need to log in!

    Thanks :)

    If you don't have an account, you can create one here.

     

Scroll to Top

Add A Knowledge Base Question !

+ = Verify Human or Spambot ?