scientific article

From MaRDI portal
Publication:2723258

zbMath0979.05001MaRDI QIDQ2723258

Walter D. Wallis

Publication date: 4 July 2001


Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.



Related Items (73)

On the total edge irregularity strength of general uniform cactus chain graphs with pendant verticesOn total vertex irregularity strength of generalized uniform cactus chain graphs with pendant verticesComplete multipartite graphs and their null setOn zero-sum \({\mathbb{Z}_k}\)-magic labelings of 3-regular graphsOn total edge irregularity strength of centralized uniform theta graphsOn total labelings of graphs with prescribed weightsSparse anti-magic squares and vertex-magic labelings of bipartite graphsOn the construction of super edge-magic total graphsOn super \((a, d)\)-edge-antimagic total labeling of special types of crown graphsVertex magic total labeling of middle and total graph of cycleEdge-antimagic graphsOn irregular total labellingsOn zero-sum \(\mathbb Z_{2j}^k\)-magic graphsPerfect (super) edge-magic crowns(Di)graph products, labelings and related resultsZero-sum magic labelings and null sets of regular graphsDependence polynomials of some graph operationsSuper \((a, d)\)-EAT labeling of subdivided starsOn magic distinct labellings of simple graphsLangford sequences and a product of digraphsOn (F, H)-simultaneously-magic labelings of graphsTotal distance vertex irregularity strength of some corona product graphsThe existence spectrum for regular sparse anti-magic squaresVertex-magic labeling of regular graphs: disjoint unions and assemblages\(E\)-super vertex magic labelings of graphsRelating edge-coverings to the classification of \(\mathbb Z^k_2\)-magic graphsOn irregularity strength of diamond networkGroup distance magic and antimagic graphsLabeling constructions using digraph productsStrong edge-magic graphs of maximum sizeOn the construction of the reflexive vertex \(k\)-labeling of any graph with pendant vertexThe power of digraph products applied to labelingsTwo new methods to obtain super vertex-magic total labelings of graphsSolution of the conjecture: if \(n\equiv 0 \pmod 4\), \(n>4\), then \(K_n\) has a super vertex-magic total labelingUnnamed ItemBounds of strong EMT strength for certain subdivision of star and bistarGraceful labellings of pathsGeneralized edge-magic total labellings of models from researching networksSupermagic graphs having a saturated vertexSuper edge magic graceful graphsInteger-magic spectra of sun graphsOn consecutive edge magic total labeling of graphsTotal edge irregularity strength of complete graphs and complete bipartite graphsConstructions of regular sparse anti-magic squaresSuper face antimagic labelings of union of antiprismsVertex-magic total labelings of even complete graphsOn super \((a,1)\)-edge-antimagic total labelings of regular graphsOn the degrees of a strongly vertex-magic graphMagic labeling of disjoint union graphsOn the total vertex irregularity strength of treesSAT and IP based algorithms for magic labeling including a complete search for total magic labelingsConsecutive magic graphsEmbedding of supplementary results in strong EMT valuations and strengthThe consecutively super edge-magic deficiency of graphs and related conceptsTotally irregular total labeling of some caterpillar graphsOn total edge irregularity strength of generalized web graphs and related graphsOn super edge-antimagic total labelings of \(mK_n\)Unnamed ItemNew constructions for the \(n\)-queens problemDIGIT SUMS AND VERTEX-LABELINGSMagic and antimagic \(H\)-decompositionsUnnamed ItemMagic labelings of trianglesOn super \((a,d)\)-edge-antimagic total labeling of disconnected graphsVertex-magic labelings of regular graphs. II.Super-vertex-antimagic total labelings of disconnected graphsOn \(k\)-minimum and \(m\)-minimum edge-magic injections of graphsOn subdivision graphs which are 2-steps Hamiltonian graphs and hereditary non 2-steps Hamiltonian graphsMagic Labelings on Cycles and WheelsTotal vertex irregularity strength of trees with maximum degree fiveVertex-magic total labeling of odd complete graphsTotal Edge Irregularity Strength of Complete Graphs and Complete Bipartite GraphsOn the existence of regular sparse anti-magic squares of odd order




This page was built for publication: