Balanced degree-magic complements of bipartite graphs

DOI10.1016/J.DISC.2013.05.002zbMATH Open1277.05147OpenAlexW1964383605MaRDI QIDQ383753FDOQ383753

Authors: L'udmila Bezegová 

Publication date: 6 December 2013

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.disc.2013.05.002

Recommendations

• A characterization of complete tripartite degree-magic graphs
• Balanced degree-magic labelings of complete bipartite graphs under binary operations
• Magic and supermagic dense bipartite graphs
• Number of edges in degree-magic graphs
• A construction of supermagic graphs

zbMATH Keywords

bipartite graphsdegree-magic graphssupermagic graphs

Mathematics Subject Classification ID

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

Cites Work

• A dynamic survey of graph labeling
• Magic Graphs
• On Hamiltonian bipartite graphs
• On supermagic regular graphs
• On conservative and supermagic graphs
• A characterization of complete tripartite degree-magic graphs
• Title not available (Why is that?)
• An extension of regular supermagic graphs
• A construction of supermagic graphs

Cited In (7)

• Title not available (Why is that?)
• Implicit degree in balanced bipartite graphs
• Magic labeling of disjoint union graphs
• Title not available (Why is that?)
• Gradual supermagic graphs
• A characterization of complete tripartite degree-magic graphs
• Magic and supermagic dense bipartite graphs

This page was built for publication: Balanced degree-magic complements of bipartite graphs

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