نتایج جستجو برای: graceful labeling
تعداد نتایج: 59022 فیلتر نتایج به سال:
A (p, q) connected graph is edge-odd graceful graph if there exists an injective map f: E(G) → {1, 3, ..., 2q-1} so that induced map f+: V(G) → {0, 1,2, 3, ..., (2k-1)}defined by f+(x) f(x, y) (mod 2k), where the vertex x is incident with other vertex y and k = max {p, q} makes all the edges distinct Reference A.Solairaju and K.Chitra Edge-odd graceful labeling of some graphs “ Electronics N...
A (p, q) connected graph is edge-odd graceful graph if there exists an injective map f: E(G) → {1, 3, ..., 2q-1} so that induced map f+: V(G) → {0, 1,2, 3, ..., (2k-1)}defined by f+(x) f(x, y) (mod 2k), where the vertex x is incident with other vertex y and k = max {p, q} makes all the edges distinct Reference A.Solairaju and K.Chitra Edge-odd graceful labeling of some graphs “ Electronics N...
A (p, q) connected graph is edge-odd graceful graph if there exists an injective map f: E(G) → {1, 3, ..., 2q-1} so that induced map f+: V(G) → {0, 1,2, 3, ..., (2k-1)}defined by f+(x) f(x, y) (mod 2k), where the vertex x is incident with other vertex y and k = max {p, q} makes all the edges distinct Reference A.Solairaju and K.Chitra Edge-odd graceful labeling of some graphs “ Electronics N...
Graceful labelling is studied on undirected graphs since graceful graphs can be used in some H-decomposition problems. In this note, we investigate the directed graceful problem for many orientations of undirected trees with short diameters, and provide some directed trees that deny any digraceful labelling. AMS Subject Classification (2000): 05C78
An assignment of integer numbers to the vertices of a given graph under certain conditions is referred to as a graph labeling. The assignment of labels from the set {0,1,2,...,2 1} q to the vertices of G (with ( ) G n V vertices and ( ) q E G edges) such that, when each edge has assigned a label defined by the absolute difference of its end-points, the resulting edge labels are 1,3 ,2 1 q is re...
Abstract In this paper we define some new labellings for trees, called the in-improper and out-improper odd-graceful labellings such that some trees labelled with the new labellings can induce graceful graphs having at least a cycle. We, next, apply the new labellings to construct large scale of graphs having improper graceful/odd-graceful labellings or having graceful/odd-graceful labellings.
This paper introduces the notion of discrete t-set graceful graphs and obtains some of their properties. It also examines the interrelations among different types of set-indexers, namely, set-graceful, set-semigraceful, topologically set-graceful (t-set graceful), strongly t-set graceful and discrete t-set graceful and establishes how all these notions are interdependent or not. AMS Mathematics...
0
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید