Number of edges in degree-magic graphs
From MaRDI portal
Publication:389489
DOI10.1016/J.DISC.2013.02.018zbMATH Open1279.05065OpenAlexW2041370049MaRDI QIDQ389489FDOQ389489
Authors: L'udmila Bezegová, Jaroslav Ivančo
Publication date: 20 January 2014
Published in: Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.disc.2013.02.018
Recommendations
Cites Work
Cited In (10)
- The average degree in a vertex-magic graph
- A class of degree-magic join graphs.
- Magic labeling of disjoint union graphs
- Gradual supermagic graphs
- Title not available (Why is that?)
- Balanced degree-magic labelings of complete bipartite graphs under binary operations
- On the existence of degree-magic labellings of the \(n\)-fold self-union of complete bipartite graphs
- A characterization of complete tripartite degree-magic graphs
- Balanced degree-magic complements of bipartite graphs
- Title not available (Why is that?)
This page was built for publication: Number of edges in degree-magic graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q389489)