scientific article; zbMATH DE number 1760750
From MaRDI portal
Publication:4537240
zbMath1008.05135MaRDI QIDQ4537240
Mirka Miller, J. A. MacDougall, S. Slamin, Walter D. Wallis
Publication date: 5 August 2002
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items (42)
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 ⋮ Sparse anti-magic squares and vertex-magic labelings of bipartite 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 ⋮ A novel approach for cyclic decompositions of balanced complete bipartite graphs into infinite graph classes ⋮ E-super arithmetic graceful labelling of \(H_i(m, m)\), \(H_i^{(1)}(m, m)\) and chain of even cycles ⋮ Strong vertex-magic and super edge-magic total labelings of the disjoint union of a cycle with 3-cycles ⋮ On magic distinct labellings of simple graphs ⋮ On (F, H)-simultaneously-magic labelings of graphs ⋮ Vertex-antimagic labelings of regular graphs ⋮ The existence spectrum for regular sparse anti-magic squares ⋮ Vertex-magic labeling of regular graphs: disjoint unions and assemblages ⋮ \(E\)-super vertex magic labelings of graphs ⋮ Group labeling of some graphs ⋮ Two new methods to obtain super vertex-magic total labelings of graphs ⋮ Unnamed Item ⋮ Solution of the conjecture: if \(n\equiv 0 \pmod 4\), \(n>4\), then \(K_n\) has a super vertex-magic total labeling ⋮ Solution to some open problems on \(E\)-super vertex magic labeling of disconnected graphs ⋮ Generalized edge-magic total labellings of models from researching networks ⋮ Supermagic graphs having a saturated vertex ⋮ Existence of centre-complementary magic rectangles ⋮ Vertex-magic total labelings of even complete graphs ⋮ Towards generalizing MacDougall's conjecture on vertex-magic total labelings ⋮ On the degrees of a strongly vertex-magic graph ⋮ Magic labeling of disjoint union graphs ⋮ SAT and IP based algorithms for magic labeling including a complete search for total magic labelings ⋮ Consecutive magic graphs ⋮ E-super vertex magic labeling of cartoon flowers and wounded flowers ⋮ Note on \(E\)-super vertex magic graphs ⋮ Graph coloring: a novel heuristic based on trailing path-properties, perspective and applications in structured networks ⋮ 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 ⋮ Magic Labelings on Cycles and Wheels ⋮ On \((a, 1)\)-vertex-antimagic edge labeling of regular graphs ⋮ Vertex-magic total labeling of odd complete graphs
This page was built for publication: