Skip to search formSkip to main contentSkip to account menuSemantic Scholar Semantic Scholar's Logo Search 206,553,445 papers from all fields of science

Search

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

2014

2014

2014

In this paper we define smooth graceful labeling and we prove that cycle n C , complete bipartite graph n K 2, and path n P are…

2014

2014

We investigate a new graph which is called Step Grid Graph. We prove that the step grid graph is graceful. We have investigate…

2012

2012

For a connected graph G of order n ≥ 3, let f : E(G) → Zn be an edge labeling of G. The vertex labeling f ′ : V (G) → Zn induced…

2010

2010

The existence problems of perfect difference families with block size k, k=4,5, and additive sequences of permutations of length…

2010

2010

In this work some new odd graceful graphs are investigated. We prove that the graph obtained by joining two copies of even cycle…

2006

2006

Several methods for breaking value symmetries have been proposed recently in the constraint programming community. They can be…

Review

2006

Review

2006

In a method for controlling a tire vulcanization of a vulcanizing apparatus, an initial green tire temperature is measured before…

2002

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…

1998

1998

We establish that all trees on at most 27 vertices admit graceful labellings and all trees on at most 26 vertices admit…