• No results found

\(k\)-graceful labeling

On \(k\)-graceful labeling of pendant edge extension of complete bipartite graphs

On \(k\)-graceful labeling of pendant edge extension of complete bipartite graphs

... a graceful labeling of a graph G with m edges if f : V (G) → {0, 1, 2, ...graph labeling, first introduced by Rosa in 1967 as a β-valuation [12], was used as a tool for decomposing a complete graph ...

12

Edge even graceful labeling of some graphs

Edge even graceful labeling of some graphs

... even graceful labeling is called an edge even graceful ...even graceful labeling of the Peterson graph and the complete graph K 5 ...

15

Duplication of some graph elements and absolute mean graceful labeling

Duplication of some graph elements and absolute mean graceful labeling

... A labeling f is said to be α - labeling, if there exists an integer k such that for each edge uv either f(u) ≤ k <| f (v) | or f(v) ≤ k <| f(u) | , ∀u, v ∈ V ...mean graceful labeling ...

9

On Odd Graceful Labeling of the Generalization of Cyclic Snakes

On Odd Graceful Labeling of the Generalization of Cyclic Snakes

... triangular snake (or  -snake) as a connected graph in which all blocks are triangles and the block-cut-point graph is a path. Let  k -snake be a  -snake with k blocks while n k -snake be a  -snake with k blocks and ...

7

Odd Graceful Labeling of Cycle with Parallel Pk Chords

Odd Graceful Labeling of Cycle with Parallel Pk Chords

... graph labeling is an assignment of integers to the vertices (or) edges or both subject to certain ...conditions. Graceful labeling was introduced by Rosa [6] while the concept of odd graceful ...

7

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 ...

5

Super Edge-antimagic Graceful labeling of Graphs

Super Edge-antimagic Graceful labeling of Graphs

... In the foregoing sections we studied super (a, d)-edge-antimagic graceful labeling for complete graphs and complete bipartite graphs. We have shown a bound for the feasible values of the parameter d and ...

6

Graceful Labeling of Some Theta Related Graphs

Graceful Labeling of Some Theta Related Graphs

... be graceful. Labeling the nodes of G with distinct nonnegative integers and then labeling the e edges of G with the absolute differences between node values, if the graph edge numbers run from 1 to ...

7

Odd Graceful Labeling of the Revised Friendship Graphs

Odd Graceful Labeling of the Revised Friendship Graphs

... Graceful and odd gracefulness of a graph are two entirely different concepts. A graph may posses one or both of these or neither. In this paper we introduced the odd graceful labeling of the revised ...

6

Odd Graceful Labeling of Some New Type of Graphs

Odd Graceful Labeling of Some New Type of Graphs

... admits graceful labeling is called a graceful ...odd graceful labeling if f: V → {0, 1, 2, ...odd graceful labeling is called an odd graceful ...

7

Some Results on Graceful Labeling for Step Grid Related Graphs

Some Results on Graceful Labeling for Step Grid Related Graphs

... Makadia, Graceful labeling for Open Star of graphs, ...Makadia, Graceful Labeling for tensor product ot two path of odd lengths and some grid related graphs, ...

10

Variation of Graceful Labeling on Disjoint Union of two Subdivided Shell Graphs

Variation of Graceful Labeling on Disjoint Union of two Subdivided Shell Graphs

... graph labeling is an assignment of integers to the vertices or edges, or both, subject to certain ...the labeling method called β-valuation as a tool for decomposing the complete graph into isomorphic ...as ...

7

Super Edge Graceful and Even Edge Graceful
Labeling of Cayley Digraphs

Super Edge Graceful and Even Edge Graceful Labeling of Cayley Digraphs

... edge graceful labeling if there is a bijection f from E to {0,±1,±2,…,±( 𝑞 − 1) / 2 } when q is odd and from E to {±1,±2,…,±𝑞/2} when q is even such that the induced vertex labeling f* defined by ...

5

On Graceful Labeling of Some Bicyclic Graphs

On Graceful Labeling of Some Bicyclic Graphs

... An graceful labeling f of a graph G with q edges is an injective function from the vertices of G to the set {0,1,2,…,q} such that when each edge xy is assigned the label |f(x)-f(y)| , the resulting edge ...

8

Pentagonal Graceful Labeling of Caterpillar Graphs

Pentagonal Graceful Labeling of Caterpillar Graphs

... pentagonal graceful labeling if its vertices can be labeled by non negative integers such that the induced edge labels obtained by the absolute difference of the labels of end vertices are the first 𝒒 ...

5

Graceful labeling of arrow graphs and double arrow graphs

Graceful labeling of arrow graphs and double arrow graphs

... [1] A.Rosa, on certain valuation of graph, theory of graphs(Rome,july1966), Golden and Breach, N.Y. In: Graph Theory and computing (R.C.Read.Ed.) Academic press.[r] ...

5

Some Graph Labelings on Middle Graph of Extended Duplicate Graph of a Path

Some Graph Labelings on Middle Graph of Extended Duplicate Graph of a Path

... graph labeling was introduced by Rosa in 1967. A graph labeling is an assignment of integers to the vertices or edges or both subject to certain ...various labeling of graphs such as graceful ...

6

Some Results on Graceful Labeling for Step Grid Related Graphs

Some Results on Graceful Labeling for Step Grid Related Graphs

... In this paper we review the Berestycki and Nadal’s model of Dynamics of criminal activity and formation of crime hotspots.. We also propose adding repeated victimi[r] ...

11

Missing Numbers in K Graceful Graphs

Missing Numbers in K Graceful Graphs

... -graceful labeling of ( ), one missing number is (set of natural numbers) and remaining missing numbers will be from ...-graceful labeling of ( ), (from corollary 1.1), numbers used in ...

6

Three Graceful Operations

Three Graceful Operations

... A graceful labeling of a graph G of size n is an injective function f : V ( G ) → {0 , 1 , ...a graceful labeling is said to be a graceful ...a graceful labeling of a ...

12

Show all 1898 documents...

Related subjects