A dynamic survey of graph labeling
From MaRDI portal
Summary: A vertex labeling of a graph \(G\) is an assignment \(f\) of labels to the vertices of \(G\) that induces for each edge \(xy\) a label depending on the vertex labels \(f(x)\) and \(f(y)\). The two best known labeling methods are called graceful and harmonious labelings. A function \(f\) is called a graceful labeling of a graph \(G\) with \(q\) edges if \(f\) is an injection from the vertices of \(G\) to the set \(\{0,1,\ldots,q\}\) such that, when each edge \(xy\) is assigned the label \({\mid}{f(x) - f(y)}{\mid}\), the resulting edge labels are distinct. A function \(f\) is called harmonious if it is an injection from the vertices of \(G\) to the group of integers modulo \(q\) such that when each edge \(xy\) is assigned the label \(f(x) + f(y)\) (mod \(q\)), the resulting edge labels are distinct. When \(G\) is a tree, exactly one label may be used on two vertices. Over the past three decades many variations of graceful and harmonious labelings have evolved and about 200 papers have been on the subject of graph labeling. In this article we survey what known about the various methods.
Recommendations
Cited in
(only showing first 100 items - show all)- Antibandwidth and cyclic antibandwidth of meshes and hypercubes
- On explicit formulas for bandwidth and antibandwidth of hypercubes
- On a conjecture of Graham and Häggkvist with the polynomial method
- A non-existence result on cyclic cycle-decompositions of the cocktail party graph
- Harmonious order of graphs
- Packing of graphs and permutations -- a survey
- Deficiency of forests
- On -fold Rosa-type labelings of bipartite multigraphs
- (Di)graph products, labelings and related results
- Graph labeling games
- 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
- Super \((a, d)\)-edge-antimagic total labelings of complete bipartite graphs
- Bimagic vertex labelings
- On the beta-number of linear forests with an even number of components
- Orientable \(\mathbb{Z}_N\)-distance magic graphs
- Graph 2-rankings
- Every cubic bipartite graph has a prime labeling except \(K_{3,3}\)
- Bounds of strong EMT strength for certain subdivision of star and bistar
- Structural behaviour of MMD labeling on some SSP bipartite graphs
- Partially magic labelings and the antimagic graph conjecture
- Some graceful three distant trees by component moving operation
- On almost graceful, felicitous and elegant graphs
- On permutation graphs
- Vertex-antimagic labelings of regular graphs
- Classification of tetravalent distance magic circulant graphs
- Antimagic labeling of the lexicographic product graph \(K_{m,n}[P_k]\)
- Caterpillars with maximum degree 3 are antimagic
- Antimagic orientation of lobsters
- Improved bounds for relaxed graceful trees
- Note on group distance magic graphs \(G[C_4]\)
- SAT and IP based algorithms for magic labeling including a complete search for total magic labelings
- New classes of graceful trees
- Antimagicness of lexicographic product graph \(G[P_n]\)
- Preservation of the classical meanness property of some graphs based on line graph operation
- \( \mathbb{Z}_2 \times \mathbb{Z}_2\)-cordial cycle-free hypergraphs
- Supermagic graphs with many different degrees
- Combinatorial configurations in the definition of antimagic labelings of graphs
- Product antimagic labeling of caterpillars
- On \(\text{Ł}(\wp, \wp - 1, \dots, 1)\) labelings of circulant graphs
- Symmetry and two symmetry measures for the web and spider web graphs
- SEMT valuation and strength of subdivided star of \(K_{1,4}\)
- Hamiltonicity of a coprime graph
- Further evidence towards the multiplicative 1-2-3 conjecture
- \(k\)-Zumkeller labeling of super subdivision of some graphs
- Strongly edge multiplicative graphs
- Vertex labeling of a half-cube to induce face labels in arithmetic progression
- Harmonious labelings of disconnected graphs involving cycles and multiple components consisting of starlike trees
- On the hardness of determining the irregularity strength of graphs
- Domination parameters of the unitary Cayley graph of \(\mathbb{Z}/n \mathbb{Z} \)
- Antimagic labeling of biregular bipartite graphs
- The spum and sum-diameter of graphs: labelings of sum graphs
- On exclusive sum labellings of hypergraphs
- On the Oberwolfach problem for single-flip 2-factors via graceful labelings
- On elegant labelling and magic labelling of large-scale graphs
- The vertex Euclidean properties of graphs
- Antimagic labeling of some biregular bipartite graphs
- Rainbow spanning trees in abelian groups
- A note on prime labeling \(k\)-partite \(k\)-graphs
- Going wide with the 1-2-3 conjecture
- Edge consecutive gracefulness of a graph
- Isoperimetry, stability, and irredundance in direct products
- Further results on edge even graceful labeling of the join of two graphs
- Balanced equi-n-squares
- Group labeling of some graphs
- Embedding rainbow trees with applications to graph labelling and decomposition
- Caterpillars are antimagic
- Labeled graph sketches: keeping up with real-time graph streams
- A new graceful labeling for pendant graphs
- On the complexity of determining the irregular chromatic index of a graph
- Magic labelings of type \((a, b, c)\) of families of wheels
- On decomposing regular graphs into isomorphic double-stars
- Strong labelings of linear forests
- Constraint models for graceful graphs
- Embedding of supplementary results in strong EMT valuations and strength
- Optimal packings of bounded degree trees
- New constructions for the \(n\)-queens problem
- The sparing number of certain graph powers
- The spectrum of group-based complete Latin squares
- Matrices associated with D-distance magic graphs and their properties
- Edge even graceful labeling of polar grid graphs
- Edge even graceful labeling of cylinder grid graph
- Edge even graceful labeling of some graphs
- Difference cordiality of product related graphs
- Graceful labeling for mushroom trees
- Any tree with m edges can be embedded in a graceful tree with less than 4m edges and in a graceful planar graph
- On zero-sum \({\mathbb{Z}_k}\)-magic labelings of 3-regular graphs
- Construction of an \(\alpha\)-labeled tree from a given set of \(\alpha\)-labeled trees
- Two constructions of \(H\)-antimagic graphs
- Perfect (super) edge-magic crowns
- Graceful labeling of some zero divisor graphs
- On \(\sigma \)-tripartite labelings of odd prisms and even Möbius ladders
- Local antimagic labeling of graphs
- Sketchy tweets: ten minute conjectures in graph theory
- Antimagic labeling of generalized pyramid graphs
- Antibandwidth and cyclic antibandwidth of Hamming graphs
- Some new results on prime cordial labeling
- The jumping knight and other (super) edge-magic constructions
- Solution of the conjecture: if \(n\equiv 0 \pmod 4\), \(n>4\), then \(K_n\) has a super vertex-magic total labeling
This page was built for publication: A dynamic survey of graph labeling
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1382967)
