A dynamic survey of graph labeling
From MaRDI portal
Publication:1382967
zbMath0953.05067MaRDI QIDQ1382967
Publication date: 2 April 1998
Published in: The Electronic Journal of Combinatorics (Search for Journal in Brave)
Full work available at URL: http://www.emis.de/journals/EJC/Surveys/
Research exposition (monographs, survey articles) pertaining to combinatorics (05-02) Graph labelling (graceful graphs, bandwidth, etc.) (05C78)
Related Items (only showing first 100 items - show all)
On the generation of alpha graphs ⋮ Minimum Coprime Labelings of Generalized Petersen and Prism Graphs ⋮ Connected certified domination edge critical and stable graphs ⋮ Tadpole domination number of graphs ⋮ MMD labeling of EASS of Cartesian product of two graphs ⋮ On face-magic labelings of regular tesselations ⋮ The maximum linear arrangement problem for trees under projectivity and planarity ⋮ Antimagic orientation of forests ⋮ On closed distance magic circulants of valency up to 5 ⋮ A proof of the multiplicative 1-2-3 conjecture ⋮ Magic partially filled arrays on abelian groups ⋮ Graph labelings obtainable by random walks ⋮ Leverage centrality analysis of infrastructure networks ⋮ Klein cordial trees and odd cyclic cordial friendship graphs ⋮ Triangulations, order polytopes, and generalized snake posets ⋮ Labeling trees of small diameters with consecutive integers ⋮ Finding large rainbow trees in colourings of \(K_{n, n}\) ⋮ Neighborhood balanced colorings of graphs ⋮ The weak \((2, 2)\)-labelling problem for graphs with forbidden induced structures ⋮ Generation of anti-magic graphs from binary graph products ⋮ k-Zumkeller graphs through splitting of graphs ⋮ Group distance magic labeling of tetravalent circulant graphs ⋮ Unnamed Item ⋮ Global and local structure‐based influential nodes identification in wheel‐type networks ⋮ Additively graceful signed graphs ⋮ Perfectly packing graphs with bounded degeneracy and many leaves ⋮ The reflexive edge strength of toroidal fullerene ⋮ Agglomeration-Based Node Importance Analysis in Wheel-Type Networks ⋮ Sum-distinguishing number of sparse hypergraphs ⋮ A linear algorithm for radio \(k\)-coloring powers of paths having small diameter ⋮ Analytic odd mean labeling of union and identification of some graphs ⋮ Local distance antimagic chromatic number for the union of star and double star graphs ⋮ Graph decompositions in projective geometries ⋮ Switched signed graphs of integer additive set-valued signed graphs ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Decomposing almost complete graphs by random trees ⋮ Unnamed Item ⋮ Group distance magic and antimagic graphs ⋮ On integral sum graphs ⋮ Supermagic graphs having a saturated vertex ⋮ The space complexity of sum labelling ⋮ Minimum Coprime Labelings for Operations on Graphs ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Unnamed Item ⋮ It Is All Labeling ⋮ Productive and sum graph labelings: a survey ⋮ On b-coloring of central graph of some graphs ⋮ Graceful labeling of power graph of group Z2k−1 × Z4 ⋮ A note on adjacent vertex distinguishing colorings of graphs ⋮ Distance magic Cartesian products of graphs ⋮ Product cordial and total product cordial labelings of \(P_{n + 1}^m\) ⋮ Spectra of graphs and closed distance magic labelings ⋮ Orthogonal double covers of circulant graphs by corona product of certain infinite graph classes ⋮ Infinitely many cyclic solutions to the Hamilton-Waterloo problem with odd length cycles ⋮ The gracefulness of the join of graphs. II ⋮ Radio mean labeling of a graph ⋮ Alpha labelings of full hexagonal caterpillars ⋮ \(C_m\)-supermagic labeling of graphs ⋮ On consecutive magic graphs ⋮ On the degrees of \(E\)-super vertex-magic graphs ⋮ Graceful and cordial labeling of subdivision of graphs ⋮ Generating graceful trees from caterpillars by recursive attachment ⋮ Further results on graceful directed graphs ⋮ Prime labeling of families of trees with Gaussian integers ⋮ On total labelings of graphs with prescribed weights ⋮ Further results on super graceful labeling of graphs ⋮ On modular edge-graceful graphs ⋮ On super \((a, d)\)-edge-antimagic total labeling of special types of crown graphs ⋮ Some results on spanning trees ⋮ On irregular total labellings ⋮ Labelings in Cayley digraphs ⋮ Balanced degree-magic complements of bipartite graphs ⋮ Full friendly index set. I ⋮ Finite prime distance graphs and 2-odd graphs ⋮ Regular graphs are antimagic ⋮ On super edge-antimagicness of subdivided stars ⋮ Deficiency of forests ⋮ On \(\lambda\)-fold Rosa-type labelings of bipartite multigraphs ⋮ (Di)graph products, labelings and related results ⋮ Graph labeling games ⋮ Minimum-weight edge discriminators in hypergraphs ⋮ Constant sum partition of sets of integers and distance magic graphs ⋮ The distance magic index of a graph ⋮ On the number of \(\alpha\)-labeled graphs ⋮ On super edge-antimagicness of circulant graphs ⋮ On partitional labelings of graphs ⋮ Super \(d\)-antimagic labelings of disconnected plane graphs ⋮ On permutation graphs ⋮ Vertex-antimagic labelings of regular graphs ⋮ Supermagic generalized double graphs ⋮ Super \((a, d)\)-edge-antimagic total labelings of complete bipartite graphs ⋮ \(E\)-super vertex magic labelings of graphs ⋮ Bimagic vertex labelings ⋮ Relating edge-coverings to the classification of \(\mathbb Z^k_2\)-magic graphs ⋮ On the beta-number of linear forests with an even number of components
This page was built for publication: A dynamic survey of graph labeling
