Javascript must be enabled to continue!
Z2nm-supermagic labeling of Cn#Cm
View through CrossRef
<p>A <span><span class="math">Γ</span>-supermagic labeling</span> of a graph <span class="math"><em>G</em> = (<em>V</em>, <em>E</em>)</span> with <span class="math">∣<em>E</em>∣ = <em>k</em></span> is a bijection from <span class="math"><em>E</em></span> to an Abelian group <span class="math">Γ</span> of order <span class="math"><em>k</em></span> such that the sum of labels of all incident edges of every vertex <span class="math"><em>x</em> ∈ <em>V</em></span> is equal to the same element <span class="math"><em>μ</em> ∈ Γ</span>. We present a <span class="math"><em>Z</em><sub>2<em>n</em><em>m</em></sub></span>-supermagic labeling of Cartesian product of two cycles, <span class="math"><em>C</em><sub><em>n</em></sub>□<em>C</em><sub><em>m</em></sub></span> for <span class="math"><em>n</em></span> odd. This along with an earlier result by Ivančo proves that a <span class="math"><em>Z</em><sub>2<em>n</em><em>m</em></sub></span>-supermagic labeling of <span class="math"><em>C</em><sub><em>n</em></sub>□<em>C</em><sub><em>m</em></sub></span> exists for every <span class="math"><em>n</em>, <em>m</em> ≥ 3</span>.</p>
UPT Penerbitan Universitas Jember
Title: Z2nm-supermagic labeling of Cn#Cm
Description:
<p>A <span><span class="math">Γ</span>-supermagic labeling</span> of a graph <span class="math"><em>G</em> = (<em>V</em>, <em>E</em>)</span> with <span class="math">∣<em>E</em>∣ = <em>k</em></span> is a bijection from <span class="math"><em>E</em></span> to an Abelian group <span class="math">Γ</span> of order <span class="math"><em>k</em></span> such that the sum of labels of all incident edges of every vertex <span class="math"><em>x</em> ∈ <em>V</em></span> is equal to the same element <span class="math"><em>μ</em> ∈ Γ</span>.
We present a <span class="math"><em>Z</em><sub>2<em>n</em><em>m</em></sub></span>-supermagic labeling of Cartesian product of two cycles, <span class="math"><em>C</em><sub><em>n</em></sub>□<em>C</em><sub><em>m</em></sub></span> for <span class="math"><em>n</em></span> odd.
This along with an earlier result by Ivančo proves that a <span class="math"><em>Z</em><sub>2<em>n</em><em>m</em></sub></span>-supermagic labeling of <span class="math"><em>C</em><sub><em>n</em></sub>□<em>C</em><sub><em>m</em></sub></span> exists for every <span class="math"><em>n</em>, <em>m</em> ≥ 3</span>.
</p>.
Related Results
Protocol for antigen labeling in eukaryotic cells and quantification by flow cytometry v1
Protocol for antigen labeling in eukaryotic cells and quantification by flow cytometry v1
Goal: This document aims to standardize the protocol used for labeling intracellular or extracellular antigens in eukaryotic cells, using antibodies already associated with fluoroc...
Programmatic Labeling of Dark Data for Artificial Intelligence in Spatial Informatics
Programmatic Labeling of Dark Data for Artificial Intelligence in Spatial Informatics
<p>Data preparation process generally consumes up to 80% of the Data Scientists time, with 60% of that being attributed to cleaning and labeling data.[1]&#160...
Functionalized polysaccharides improve sensitivity of tyramide/peroxidase proximity labeling assays through electrostatic interactions
Functionalized polysaccharides improve sensitivity of tyramide/peroxidase proximity labeling assays through electrostatic interactions
High-throughput assays that efficiently link genotype and phenotype with high fidelity are key to successful enzyme engineering campaigns. Among these assays, the tyramide/peroxida...
Competitiveness Assessment of Tonic Drinks Labeling
Competitiveness Assessment of Tonic Drinks Labeling
Labeling of alcoholic-free tonic beverages (AFTB) is an important element in the quality
indicators system. Not all manufacturers, unfortunately, provide reliable information regar...
Wn-SUPER MAGIC LABELING ON GRAPH Pm ⊵e Wn
Wn-SUPER MAGIC LABELING ON GRAPH Pm ⊵e Wn
Suppose G graph, H subgraph of G, then graph G admits H-covering having an H-magic labeling if there exist a bijective function mapping V (G) ∪ E(G) to a set of natural number at m...
Mass Spectrometry of Peptides and Proteins
Mass Spectrometry of Peptides and Proteins
Abstract
Originally published in: Proteomics in Drug Research. Edited by Michael Hamacher, Katrin Marcus, Kai Stühler, André van Hall, Bettina Warscheid and Helmut E. Mey...
k-super cube root cube mean labeling of graphs
k-super cube root cube mean labeling of graphs
Consider a graph G with |V (G)| = p and |E(G)| = q and let f : V (G) → {k, k + 1, k + 2, . . . p + q + k − 1}} be an injective function. The induced edge labeling f ∗ for a vertex ...
Perbandingan Performa Labeling Lexicon InSet dan VADER pada Analisa Sentimen Rohingya di Aplikasi X dengan SVM
Perbandingan Performa Labeling Lexicon InSet dan VADER pada Analisa Sentimen Rohingya di Aplikasi X dengan SVM
Rohingya in Indonesia has become trending conversation on social media. Sentiment analysis can get public responds. Big data makes the problem time efficiency labeling process, the...


