N-set distance-labelings for cycle graphs

HIGHLIGHTS

  • who: Alissa Shen and Jian Shen from the StStephen's Episcopal School, Austin, TX, USA Department of Mathematics, Texas State University, San Marcos, TX, USA have published the article: N-Set Distance-Labelings for Cycle Graphs, in the Journal: (JOURNAL) of May/18,/2022
  • what: The authors provide a general algorithm to find the label assignment for the purpose of finding the upper bound of λ1( ( Cm ) with n ≥ 3 for the fol- lowing uncovered cases: 1) m ≡ 1( mod 3) with m=4, 7,,3n - 2; and 2) m ≡ 2 ( mod 3) with m . . .

     

    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 ?