Search
Close this search box.

Contents

Journal of Combinatorial Mathematics and Combinatorial Computing

  • Research article

How Many Graphs are Super Edge-Magic? An Asymptotic Approach

G. Aranjo1, R.M. Figueroa-Centeno2, R. Ichishima3, F. A. Muntaner-Batle4
1Instituto de Matematicas, Universidad Nacional Auténoma de México, 04510 México D.F.
2Mathematics Departament, University of Hawaii-Hilo, 200 W. Kawili St. Ililo, HI 96720, U.S.A.
3College of Humanities and Sciences, Nihon University, 3-25-40 Sakurajosui Setagaya-ku, Tokyo 156-8550, Japan
4Departament de Matematica Aplicada i Telematica, Universitat Politécnica de Catalunya, 08071 Barcelona, Spain.
  • Published: 31/05/2008

Abstract

We study the number of super edge-magic (bipartite) graphs from an asymptotic point of view.

Keywords: edge-magic labelling, edge-magic total la- belling, harmonious labelling, super edge-magic labelling.
Information
Guidelines
CP Initiatives
Follow CP
Facebook Twitter Linkedin
1970-2024 CP (Manitoba, Canada) unless otherwise stated.
Citation
G. Aranjo, R.M. Figueroa-Centeno, R. Ichishima, F. A. Muntaner-Batle. How Many Graphs are Super Edge-Magic? An Asymptotic Approach[J], Journal of Combinatorial Mathematics and Combinatorial Computing, Volume 065. 33-40. DOI: .