Konu "Covering" için Matematik Bölümü Koleksiyonu listeleme

Toplam kayıt 2, listelenen: 1-2

    • C-m-SUPERMAGIC LABELING OF FRIENDSHIP GRAPHS 

      Öner, Tarkan (TURKIC WORLD MATHEMATICAL SOC, 2021)
      The friendship graph Fmn is obtained by joining n copies of the cycle graph Cm with a common vertex. In this work, we investigate the Cm-supermagic labeling of friendship graphs.

    • On C-m-Supermagicness of Book-Snake Graphs 

      Öner, Tarkan; Erol, Ebru (UNIV PUNJAB, DEPT MATHEMATICS, 2021)
      Graph labelling or valuation is a function that maps graph elements (vertices or edges) to numbers, usually positive integers [7]. In this work, we analyze the supermagicness of book-snake graphs. At first, we show that ...