نتایج جستجو برای: graceful labeling
تعداد نتایج: 59022 فیلتر نتایج به سال:
A (p, q) connected graph is edge-odd graceful graph if there exists an injective map f: E(G) → {1, 3, ..., 2q1} 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 and odd. In this article, the Edge-odd gracefulness of C3 Pn and C3 2Pn is obtained.
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.
The ladder graph plays an important role in many applications as Electronics, Electrical and Wireless communication areas. The aim of this work is to present a new class of odd graceful labeling for the ladder graph. In particular, we show that the ladder graph Ln with m-pendant Ln mk1 is odd graceful. We also show that the subdivision of ladder graph Ln with m-pendant S(Ln) mk1 is odd grace...
The Graceful Tree Conjecture is getting old – though 40 years are not so many – while researchers form all over the world keep on trying to put an affirmative end to it. Kotzig called a disease the effort of proving it. In this paper we fall into the opposite disease, namely by moving towards the search of a tree that is not graceful. Our first result, on suitable attachments of graceful trees,...
I.Cahit introduced cordial graphs as a weaker version of graceful and harmonious graphs. The total product cordial labeling is a variant of cordial labeling. In this paper we introduce a vertex analogue product cordial labeling as a variant of total product cordial labeling and name it as total vertex product cordial labeling. Finally, we investigate total vertex product cordial labeling for ma...
Graph labeling traces its origin to the famous conjecture that all trees are graceful presented by A.Rosa in 1966. In recent years, many research papers on graceful graph have been published. In this survey we have collected studies on the gracefulness of the directed circuit ~ Cm and the union graph of mutually non-intersecting ~ Cm, the digraph n · ~ Cm, the digraph n − ~ Cm, the union of the...
The prime index graph π(G) of a finite group G is special type undirected simple whose vertex set subgroups G, in which two distinct vertices are adjacent if one has the other. Let p and q be primes. In this paper, we establish that cyclic p-group Zpn, abelian Zpn × Zq Zp always have graceful labeling without any condition on n using concept path or p-layer ladder size + 1.
Tree is one of the most studied and practically useful classes of graphs and is the attention of a great number of studies. There is absence of generalized results for tree as a class and even for one kind of labeling as whole. Only specialized results exist limited to specific types of trees only. A number of conjectures stand being unsolved. Graham and Sloane (1980) conjectured trees to be Ha...
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید