نتایج جستجو برای: graceful labeling
تعداد نتایج: 59022 فیلتر نتایج به سال:
We show that to each graceful labelling of a path on 2s + 1 vertices, s ≥ 2, there corresponds a current assignment on a 3-valent graph which generates at least 22s cyclic oriented triangular embeddings of a complete graph on 12s + 7 vertices. We also show that in this correspondence, two distinct graceful labellings never give isomorphic oriented embeddings. Since the number of graceful labell...
The problem of finding a graceful labelling of a graph, or proving that the graph is not graceful, has previously been modelled as a CSP. A new and much faster CSP model of the problem is presented, with several new results for graphs whose gracefulness was previously unknown. Several classes of graph that are conjectured to be graceful only for small instances are investigated: after a certain...
Let G = (V, E) be a finite, simple and undirected graph. A graph G with q edges is said to be odd-graceful if there is an injection f : V (G) → {0, 1, 2, . . . , 2q− 1} such that, when each edge xy is assigned the label |f (x)− f (y)| , the resulting edge labels are {1, 3, 5, . . . , 2q− 1} and f is called an odd graceful labeling of G. Motivated by the work of Z. Gao [6] in which he studied th...
An odd graceful labeling of a graph ( , ) G V E = is a function : ( ) {0,1,2, . . .2 ( ) 1} f V G E G → − such that | ( ) ( )| f u f v − is odd value less than or equal to 2 ( ) 1 E G − for any , ( ) u v V G ∈ . In spite of the large number of papers published on the subject of graph labeling, there are few algorithms to be used by researchers to gracefully label graphs. This work provides gene...
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 m vertex and m edges is odd graceful if and only if m even, she proved the cycle graph is not graceful if m odd. In this paper, firstly, we studied the graph m n C P ∪ when 4, 6,8,10 m = and then we proved that the graph m n C P ∪ is odd graceful if m is even. Finall...
Graceful labeling is one of the best known labeling methods of graphs. Despite the large number of papers published on the subject of graph labeling, there are few particular techniques to be used by researchers to gracefully label graphs. In this paper, first a new approach based on the mathematical programming technique is presented to model the graceful labeling problem. Then a “branching me...
The even graceful labeling of a graph G with q edges means that there is an injection f : V(G) to { 0,1,1,1,2,...,2q+i/i= 1 to n} such that when each edge uv is assigned the label |f(u) – f(v)| the resulting edge labels are {1,3,5,...,2q-1}. A graph which admits an edge odd graceful labeling is called an edge-odd graceful graph. In this paper, the edge odd gracefulness of paths p1, p2, p3,..., ...
A shell graph is the join of a path P k of 'k' vertices and K 1. A subdivided shell graph can be constructed by subdividing the edges in the path of the shell graph. In this paper we prove that the disjoint union of two subdivided shell graphs is odd graceful and also one modulo three graceful. 1. Introduction A graph labeling is an assignment of integers to the vertices or edges, or both, subj...
A rooted tree with diameter D is said to have an even degree sequence if every vertex has even degree except for one root and the leaves, which are in the last level D/2 . The degree sequence is said to be quasi even if every vertex has even degree except for one root, every vertex in level D/2 − 1 and the leaves, which are in the last level D/2 . Hrnčiar and Haviar [P. Hrnčiar, A. Haviar, All ...
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید