Answers are grounded in this paper and cite their sources.
Let G be a simple, finite, connected, undirected, non-trivial graph with vertices and edges. be the vertex set and be the edge set of Let where a and is an injective function. If for each edge defined by is a bijective function then the function is called arithmetic sequential graceful labeling. The graph with arithmetic sequential graceful labeling is called arithmetic sequential graceful graph. In this paper, arithmetic sequential graceful labeling for some special graphs were studied.
No takes yet. Share an insight, caveat, or question.
Sumathi et al. (2024) studied this question.
Synapse has enriched 10 related papers. Consider them for comparative context: