Publication:4537240
From MaRDI portal
zbMath1008.05135MaRDI QIDQ4537240
Mirka Miller, J. A. MacDougall, S. Slamin, Walter D. Wallis
Publication date: 5 August 2002
05C78: Graph labelling (graceful graphs, bandwidth, etc.)
Related Items
Supermagic graphs having a saturated vertex, Magic Labelings on Cycles and Wheels, Wheels are cycle-antimagic, \(E\)-super vertex magic regular graphs of odd degree, On the degrees of \(E\)-super vertex-magic graphs, On \(V\)-super and \(E\)-super vertex-magic total labelings of graphs, Vertex magic total labelings of 2-regular graphs, On total labelings of graphs with prescribed weights, Vertex-magic labeling of regular graphs: disjoint unions and assemblages, \(E\)-super vertex magic labelings of graphs, Generalized edge-magic total labellings of models from researching networks, Vertex-magic total labelings of even complete graphs, Solution to some open problems on \(E\)-super vertex magic labeling of disconnected graphs, Note on \(E\)-super vertex magic graphs, Sparse anti-magic squares and vertex-magic labelings of bipartite graphs, Two new methods to obtain super vertex-magic total labelings of graphs, A conjecture on strong magic labelings of 2-regular graphs, Magic labelings of triangles, Vertex-magic labelings of regular graphs. II., Super-vertex-antimagic total labelings of disconnected graphs, Existence of centre-complementary magic rectangles, Vertex-antimagic labelings of regular graphs, Magic labeling of disjoint union graphs, SAT and IP based algorithms for magic labeling including a complete search for total magic labelings, On \((a, 1)\)-vertex-antimagic edge labeling of regular graphs, A new labeling construction from the \(\otimes_h\)-product, Strong vertex-magic and edge-magic labelings of 2-regular graphs of odd order using Kotzig completion, Solution of the conjecture: if \(n\equiv 0 \pmod 4\), \(n>4\), then \(K_n\) has a super vertex-magic total labeling, On the degrees of a strongly vertex-magic graph, Consecutive magic graphs, Vertex-magic total labeling of odd complete graphs
