Abstract
A graph labeling is an assignment of integers to the vertices or edges, or both, subject to certain conditions. Graph labelings were first introduced in the mid-1960s. In the intervening years over 200 graph labelings techniques have been studied in over 3000 papers. Finding out what has been done for any particular kind of labeling and keeping up with new discoveries is difficult because of the sheer number of papers and because many of the papers have appeared in journals that are not widely available. In this survey, I have collected everything I could find on graph labeling. For the convenience of the reader, the survey includes a detailed table of contents and index. This edition has 267 new references that are identified with the reference number and the word "new" in the right margin.
Publisher
The Electronic Journal of Combinatorics
Subject
Computational Theory and Mathematics,Geometry and Topology,Theoretical Computer Science,Applied Mathematics,Discrete Mathematics and Combinatorics
Cited by
22 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Conservative trees;Discrete Mathematics;2024-03
2. Prime labeling of graphs constructed from wheel graph;Heliyon;2024-01
3. Constant Sum Group Flows of Graphs;Mathematics;2023-12-13
4. A New Algorithm for Encryption and Decryption Using AUM Block Sum Labeling;Proceedings of International Conference on Network Security and Blockchain Technology;2023-11-29
5. Square Difference Labeling of Bloom Graph;Journal of Advanced Computational Intelligence and Intelligent Informatics;2023-11-20