Supermagic graphs having a saturated vertex

DOI10.7151/DMGT.1711MaRDI QIDQ5405278zbMATH OpenOpenAlexFDO

Authors Jaroslav Ivančo, Tatiana Polláková

Publication date 2 April 2014

Published in Discussiones Mathematicae Graph Theory (Search for Journal in Brave)

Copyright license Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International

Full work available at URL https://doi.org/10.7151/dmgt.1711

zbMATH Keywords

vertex-magic total labelingsaturated vertexsupermagic graph

Mathematics Subject Classification ID

Graph labelling (graceful graphs, bandwidth, etc.) (05C78)

Recommendations

• Numbers of edges in supermagic graphs
• scientific article; zbMATH DE number 4132212
• On supermagic regular graphs
• A construction of supermagic graphs
• Gradual supermagic graphs

Cites work

• scientific article; zbMATH DE number 1614340 (Why is no real title available?)
• scientific article; zbMATH DE number 1760750 (Why is no real title available?)
• A construction of supermagic graphs
• A dynamic survey of graph labeling
• Magic Graphs
• Magic and supermagic dense bipartite graphs
• Magic graphs having a saturated vertex
• On conservative and supermagic graphs
• On magic joins of graphs
• On supermagic regular graphs
• Some constructions of supermagic graphs using antimagic graphs

Cited in

(8)

• scientific article; zbMATH DE number 4132212 (Why is no real title available?)
• Magic graphs having a saturated vertex
• On the supermagic edge-splitting extension of graphs.
• Supermagic graphs with many different degrees
• scientific article; zbMATH DE number 2202081 (Why is no real title available?)
• Supermagic labeling of an \(s\)-duplicate of \(K_{n,n}\)
• Some initial results on the supermagicness of regular complete \(k\)-partite graphs
• Super-magic complete \(k\)-partite hypergraphs

This page was built for publication: Supermagic graphs having a saturated vertex

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5405278)