• No results found

Graceful graphs

Graceful graphs and its applications

Graceful graphs and its applications

... of Graceful Graphs in the field of Computer Science, namely, MULTI PROTOCOL LABEL MPLS) related to ...of graceful labeling concept in Computer Networks via ...

6

Snakes and Caterpillars in Graceful Graphs

Snakes and Caterpillars in Graceful Graphs

... of graceful graphs all of them obtained applying a general substitution ...new graceful graph. We present five families of graphs where this replacement is feasible, generalizing in this way ...

11

Some Adjacent Edge Graceful Graphs

Some Adjacent Edge Graceful Graphs

... edge graceful labeling was first introduced in ...edge graceful labeling of graphs and some non- adjacent edge graceful graphs are discussed in ...

10

Missing Numbers in K Graceful Graphs

Missing Numbers in K Graceful Graphs

... We have extended the result of Maheo and Thuillier [8] that is -graceful, for every (set of natural numbers) either even or odd. In -graceful labeling of , and hairy cycle , there are missing numbers. A ...

6

Some Classes of Set Graceful Graphs

Some Classes of Set Graceful Graphs

... of graphs, B.D.Acharya defined Set indexer,set graceful and set sequential graphs in ...set graceful graph and found some classes of set graceful ...

7

Adjacent Edge Graceful Graphs

Adjacent Edge Graceful Graphs

... All graphs in this paper are finite, simple and undirected ...edge graceful labeling was first introduced in [2] and the concept of strong edge graceful labeling was introduced in ...edge ...

11

Constructing Graceful Graphs with Caterpillars

Constructing Graceful Graphs with Caterpillars

... Modifying the permissable vertex labels and/or the weights of a graceful labeling, Rosa [13] introduced the concept of ˆ ρ-labelings. An injective function f : V (G) → {0, 1, . . . , n + 1} is called a ˆ ...

9

Three Graceful Operations

Three Graceful Operations

... be graceful when is possible to assign distinct integers from {0 , 1 , ...of graceful graphs; these families are obtained via three different operations: the third power of a caterpillar, the ...

12

Super Edge Graceful and Even Edge Graceful
Labeling of Cayley Digraphs

Super Edge Graceful and Even Edge Graceful Labeling of Cayley Digraphs

... of graceful labeling for digraphs ...more graphs. Lee et al [8] defined super edge graceful labeling for some undirected ...edge graceful labeling for undirected ...edge graceful and ...

5

Edge Odd Graceful Labeling for Different Paths using Padavon Sequence

Edge Odd Graceful Labeling for Different Paths using Padavon Sequence

... of graceful graphs and graceful labeling methods was introduced by ...produces graceful labeling. However the term graceful labeling was not used until Golomb studied such labeling ...

5

Odd Graceful Labeling of Some New Type of Graphs

Odd Graceful Labeling of Some New Type of Graphs

... and graceful graphs was introduced by ...odd graceful graphs and she has proved many ...and graphs obtained fromthem by subdividing each step exactly ...

7

Vol 8, No 10 (2017)

Vol 8, No 10 (2017)

... odd-graceful graphs lies between the class of interlaced graphs and the class of bipartite graphs by showing that every interlaced graph has an odd-graceful labeling and every graph ...

7

Odd Graceful Labeling of the Revised Friendship Graphs

Odd Graceful Labeling of the Revised Friendship Graphs

... A graph G of size q is odd-graceful, if there is an injection  from V(G) to {0, 1, 2, …, 2q-1} such that, when each edge xy is assigned the label or weight |  (x) -  (y)|, the resulting edge labels are {1, 3, ...

6

Graceful numbers

Graceful numbers

... 2. Main results. Given a natural number n one can generate a graph D(n) that reflects the structure of divisors of n as follows. The vertices of the graph represent all the divisors of the number n , each vertex is ...

5

Gracefulness of Some Super Graphs of KC4 -Snake

Gracefulness of Some Super Graphs of KC4 -Snake

... of graceful graphs from a given graceful graph while Rosa [7] and Golomb [5] have discussed gracefulness of complete bipartite graphs and Eulerian ...

6

Set-Valuations of Graphs and their Applications: A Survey

Set-Valuations of Graphs and their Applications: A Survey

... of graceful graphs and graceful labeling methods was introduced by Rosa [95] the term graceful graph was used first by Golomb in 1972 ...a graceful labeling of a graph G the resulting ...

35

Super Edge-antimagic Graceful labeling of Graphs

Super Edge-antimagic Graceful labeling of Graphs

... -edge-antimagic graceful labeling of G if the edge-weights w(xy) = |g(x) + g(y) − g(xy)|, xy ∈ E(G), form an arithmetic progression starting from a and having a common difference ...-edge-antimagic graceful ...

6

Super Fibonacci Gracefulness of Shell Related Graphs

Super Fibonacci Gracefulness of Shell Related Graphs

... “ Graceful labeling “was introduced by Rosa ...Fibonacci graceful graphs. A Fibonacci graceful labeling and Super Fibonacci graceful labeling have been introduced by Kathiresan and ...

7

Super Face Anti-magic Labeling of Subdivided Prism Graph

Super Face Anti-magic Labeling of Subdivided Prism Graph

... type (1, 1, 1). The labeling of type (1, 1, 1) is called face magic (or face anti-magic resp.), if all faces of a graph have same (or different resp.) weight. A face anti-magic labeling is called super, if the smallest ...

9

Automation of fault tolerant graceful degradation

Automation of fault tolerant graceful degradation

... The graceful program from Section VII did not entirely handle the read restrictions. Hence, the input program would remove certain transitions that potentially violate the read restrictions. Observe that the first ...

23

Show all 3708 documents...

Related subjects