Graph labeling
JA Gallian - The electronic journal of combinatorics, 2012 - combinatorics.org
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 …
certain conditions. Graph labelings were first introduced in the mid 1960s. In the intervening …
[PDF][PDF] A family of graceful diameter six trees generated by component moving techniques
Abstract Aims/Objectives: To identify some new classes of graceful diameter six trees using
component moving transformation techniques. Study Design: Literature Survey to our …
component moving transformation techniques. Study Design: Literature Survey to our …
[PDF][PDF] Recent developments on gracefulness of graphs. A survey complemented with chessboard representations
K Kotul'ová, M Haviar - series Mathematics, 2020 - actamath.savbb.sk
We present a survey of selected new results about graceful labellings of graphs which were
published during the last seven years. Among them a proof of famous Ringel-Kotzig …
published during the last seven years. Among them a proof of famous Ringel-Kotzig …