Some Difference Graphs
M. A. Seoud, M. M. Farid, M. Anwar

TL;DR
This paper investigates difference labelings for various standard graphs, proving certain families are difference graphs and introducing new labelings, with implications for classifying specific graphs like complete bipartite graphs.
Contribution
It establishes difference labelings for several graph families and introduces a corollary that aids in classifying graphs as difference graphs or not.
Findings
Proved that Star, Butterfly, Bistar, umbrella, and Olive tree are difference graphs.
Introduced difference labelings for specific snake graphs.
Provided a method to determine non-difference graphs like K_{2,4}.
Abstract
In this paper, we discuss difference labeling of some standard families of graphs. We prove that Star, Butterfly, Bistar, umbrella and Olive tree are difference graphs. We also introduce difference labelings for some snakes (double triangular snake, irregular triangular snake, alternate snake). Furthermore we introduce a corollary helps us to find a unique difference labeling for the complete graph and all forms of difference labeling for the Star graph. Also this corollary can be used to prove that the complete bipartite graph is not a difference graph but the proof is very lengthy.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsGraph Labeling and Dimension Problems · graph theory and CDMA systems
