Balanced degree-magic labelings of complete bipartite graphs under binary operations
From MaRDI portal
Recommendations
- Balanced degree-magic complements of bipartite graphs
- Magic and supermagic dense bipartite graphs
- On the existence of degree-magic labellings of the \(n\)-fold self-union of complete bipartite graphs
- Magic labeling of disjoint union graphs
- A characterization of complete tripartite degree-magic graphs
Cites work
- A characterization of complete tripartite degree-magic graphs
- A dynamic survey of graph labeling
- An extension of regular supermagic graphs
- Balanced degree-magic complements of bipartite graphs
- Integer-magic spectra of cycle related graphs
- Magic Graphs
- Number of edges in degree-magic graphs
- On conservative and supermagic graphs
Cited in
(5)
This page was built for publication: Balanced degree-magic labelings of complete bipartite graphs under binary operations
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4965332)