Enumeration of the edge weights of symmetrically designed graphs
From MaRDI portal
Publication:2052124
Summary: The idea of super \((a, 0)\)-edge-antimagic labeling of graphs had been introduced by \textit{H. Enomoto} et al. [SUT J. Math. 34, No. 2, 105--109 (1998; Zbl 0918.05090)] in the late nineties. This article addresses super \((a, 0)\)-edge-antimagic labeling of a biparametric family of pancyclic graphs. We also present the aforesaid labeling on the disjoint union of graphs comprising upon copies of \(C_4\) and different trees. Several problems shall also be addressed in this article.
Recommendations
Cites work
- scientific article; zbMATH DE number 2186989 (Why is no real title available?)
- scientific article; zbMATH DE number 47933 (Why is no real title available?)
- scientific article; zbMATH DE number 1269934 (Why is no real title available?)
- scientific article; zbMATH DE number 951849 (Why is no real title available?)
- Magic Valuations of Finite Graphs
- On super edge-antimagic total labeling of subdivided stars
- On super edge-magic deficiency of unicyclic graphs
- On super edge-magicness of two special families of graphs
- Some super edge-magic (p, q)-graphs with magic constant 3p
- Super (a,d)-edge antimagic total labeling of some classes of graphs
- Super edge-magic total labeling on w-trees
- The place of super edge-magic labelings among other classes of labelings
- Vertex-antimagic labelings of regular graphs
Cited in
(4)
This page was built for publication: Enumeration of the edge weights of symmetrically designed graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2052124)