Edge-antimagic graphs
From MaRDI portal
A bijection \(g: V(G) \cup E(G) \rightarrow \{1, 2, \dots , | V(G)| +| E(G)| \}\) is called an \((a,d)\)-edge-antimagic total labeling of graph \(G\) if the edge-weights \(g(x)+g(xy)+g(y)\) over all edges \(xy\) form an arithmetic progression with initial term \(a\) and difference \(d\). Such a labeling is super if \(g(V(G))=\{1,2,\dots,| V(G)|\} \). The authors calculate properties of \(a\) and \(d\) for which various families of graphs have such labelings.
Recommendations
Cites work
- scientific article; zbMATH DE number 1614340 (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 854567 (Why is no real title available?)
- Magic Valuations of Finite Graphs
- New constructions of magic and antimagic graph labelings
- The place of super edge-magic labelings among other classes of labelings
Cited in
(36)- Super \((a, d)\)-edge-antimagic total labelings of complete bipartite graphs
- Antimagicness of generalized corona and snowflake graphs
- Enumeration of the edge weights of symmetrically designed graphs
- On super edge-antimagic total labelings of mK_n
- On two conjectures concerning (a,d)-antimagic labellings of antiprisms
- New constructions of magic and antimagic graph labelings
- On antimagic labellings of some cycle related graphs
- Super (a,d)-edge antimagic total labeling of some classes of graphs
- Construction of new larger \((a,d)\)-edge antimagic, vertex graphs by using adjacency matrices
- A method to generate large classes of edge-antimagic trees
- Edge-antimagic labelings of forests
- scientific article; zbMATH DE number 6837049 (Why is no real title available?)
- Super (a,d)-edge antimagic total labelings of friendship and generalized friendship graphs
- On total labelings of graphs with prescribed weights
- (a, d)-edge-antimagic vertex labeling of graphs
- Some results about super edge-magic and (k,d)-arithmetic graphs and labelings
- Super edge-antimagic total labelings
- On super edge-antimagic total labeling of Toeplitz graphs
- Edge antimagic total labeling on paths and unicycles
- On super \((a, d)\)-edge-antimagic total labeling of special types of crown graphs
- Weighted-1-antimagic graphs of prime power order
- On super (a, d)-edge anitmagic total labeling of certain families of graphs
- On super edge-antimagic total labeling of subdivided stars
- scientific article; zbMATH DE number 742845 (Why is no real title available?)
- New construction on edge-antimagic labeling
- scientific article; zbMATH DE number 1422778 (Why is no real title available?)
- Formulas and algorithms of antimagic labelings of some helm related graphs
- Super edge-antimagic graceful labeling of graphs
- Super edge-antimagic labelings of the path-like trees
- Further results on antimagic graph labelings
- On (a,d)-antimagic special trees, unicyclic graphs and complete bipartite graphs.
- scientific article; zbMATH DE number 7593805 (Why is no real title available?)
- Computing edge weights of symmetric classes of networks
- On e-super (a, d)-edge antimagic total labeling of total graphs of paths and cycles
- On super edge-antimagicness of subdivided stars
- On super edge-antimagicness of circulant graphs
This page was built for publication: Edge-antimagic graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q878610)
