Edge-magic total labelings of wheels, fans and friendship graphs

By Slamin, M. Bača, Yuqing Lin, Mirka Miller, Rinovia Simanjuntak. 2002

46 citations recorded by the source corpus.

View Paper: https://www.semanticscholar.org/paper/afb52584ad7b9a37ec75b5e3b21d85604e7ccb0b

How researchers see this paper

The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.

1. Joseph A. Gallian
2. Sudhakar Shetty
3. S. M. Hegde

Citations in the corpus

• On magic graphs (2003, background): “Let C(a,b) be a caterpillar with bipartition {A, B} of its vertex set V (C(a,b)), where A = {u1, u2, . . . , ua} and B = {v1, v2, . . . , vb}.”
• A Dynamic Survey of Graph Labeling (2009, methodology): “Slamin, Bača, Lin, Miller, Simanjuntak [2191] proved that the friendship graph consisting of n triangles is super edge-magic if and only if n is 3, 4, 5, or 7.”