نتایج جستجو برای: graceful labellings
تعداد نتایج: 1772 فیلتر نتایج به سال:
Recently, argument labellings have been proposed as a new (equivalent) way to express the extension semantics of Abstract Argumentation (AA) frameworks. Here, we introduce a labelling approach for the complete semantics in Assumption-Based Argumentation (ABA), where labels are assigned to assumptions rather than whole arguments. We prove that the complete assumption labelling corresponds to the...
Two new graph characteristics, the total vertex irregularity strength and the total edge irregularity strength, are introduced. Estimations on these parameters are obtained. For some families of graphs the precise values of these parameters are proved. © 2006 Elsevier B.V. All rights reserved.
Let G =( V, E) be a graph. A bijectionf: V+{ 1,2,. ., 1 VI} IS called a prime labelling if for each e = {u, u} in E, we have GCD(f(u),f(u))= 1. A graph admits a prime labelling is called a prime graph. Around ten years ago, Roger Entringer conjectured that every tree is prime. So far, this conjecture is still unsolved. In this paper, we show that the conjecture is true for trees of order up to ...
Abstract. Simple families of increasing trees can be constructed from simply generated tree families, if one considers for every tree of size n all its increasing labellings, i. e. labellings of the nodes by distinct integers of the set {1, . . . , n} in such a way that each sequence of labels along any branch starting at the root is increasing. Three such tree families are of particular intere...
Successful multi-target tracking requires solving two problems localize the targets and label their identity. An isolated target’s identity can be unambiguously preserved from one frame to the next. However, for long sequences of many moving targets, like a football game, grouping scenarios will occur in which identity labellings cannot be maintained reliably by using continuity of motion or ap...
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,..., ...
Objectives: To identify a new family of Arithmetic sequential graceful graphs. Methods: The methodology involves mathematical formulation for labeling the vertices given graph and subsequently establishing that these formulations give rise to arithmetic labeling. Findings: In this study, we analyzed some star related graphs namely Star graph, Ustar, t-star, double proved possess Novelty: Here, ...
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید