# Graceful labeling

## Papers overview

Semantic Scholar uses AI to extract papers important to this topic.

2015

2015

- 2015

For a graph G = (V,E), a bijection g from V (G) ∪ E(G) into {1, 2, . . . , |V (G)| + |E(G)|} is called (a, d)-edge-antimagic… (More)

Is this relevant?

2015

2015

- 2015

A p. q graph G = V,E is said to be a square graceful graph ifthere exists an injective function f: V G → 0,1,2,3,... , q such… (More)

Is this relevant?

2015

2015

- Electronic Notes in Discrete Mathematics
- 2015

A (p, q) graph G is edge magic graceful if there exists a bijection f : V (G)∪E(G)→ {1, 2, . . . , p+ q} such that |f(u) + f(v… (More)

Is this relevant?

2014

2014

- 2014

For any n, we denote the graph Kn,n K1 by G. In this paper we independently show that for any positive integer n ≥ 2 the… (More)

Is this relevant?

2013

2013

- 2013

In this paper, we prove that the square graph of bistar Bn,n, the splitting graph ofBn,n and the splitting graph of star K1,n are… (More)

Is this relevant?

2013

2013

- Ars Comb.
- 2013

We introduce a generalization of the well known concept of a graceful labeling. Given a graph Γ with e = d · m edges, we call d… (More)

Is this relevant?

2013

2013

- 2013

In this paper we prove that arbitrary Supersubdivision of disconnected graph is graceful.

Is this relevant?

Review

2012

Review

2012

- 2012

Graceful graphs were first studied by Rosa in 1966. The Kotzig-Ringel graceful tree conjecture states that every tree has a… (More)

Is this relevant?

2010

2010

- ArXiv
- 2010

In 1991, Gnanajothi [4] proved that the path graph n P with n vertex and 1 n − edge is odd graceful, and the cycle graph m C with… (More)

Is this relevant?

2002

2002

- Electr. J. Comb.
- 2002

A graph G on m edges is considered graceful if there is a labelling f of the vertices of G with distinct integers in the set {0… (More)

Is this relevant?