نتایج جستجو برای: graceful labellings
تعداد نتایج: 1772 فیلتر نتایج به سال:
We use graceful labellings of paths to give a new way of constructing terraces for cyclic groups. These terraces are then used to find cyclic solutions to the three table Oberwolfach problem, OP(r, r, s), where two of the tables have equal size. In particular we show that, for every odd r ≥ 3 and even r with 4 ≤ r ≤ 16, there is a number Nr such that there is a cyclic solution to OP(r, r, s) wh...
A magic labelling of a graph G with sum s is the edges by nonnegative integers such that for each vertex v∈V, labels all incident to v equal same number s. Stanley gave remarkable results on labellings, but distinct case much more complicated. We consider complete construction labellings given G. The idea illustrated in detail dealing three regular graphs and non-regular graph. give combinatori...
We study affine permutation diagrams and their labellings with positive integers. Balanced labellings of a Rothe diagram of a finite permutation were defined by FominGreene-Reiner-Shimozono, and we extend this notion to affine permutations. The balanced labellings give a natural encoding of the reduced decompositions of affine permutations. We show that the sum of weight monomials of the column...
It is known that a graded lattice of rank n is supersolvable if and only if it has an EL-labelling where the labels along any maximal chain are exactly the numbers 1, 2, . . . , n without repetition. These labellings are called Sn EL-labellings, and having such a labelling is also equivalent to possessing a maximal chain of left modular elements. In the case of an ungraded lattice, there is a n...
A graceful labeling of a graph G of size n is an injective assignment of integers from {0, 1,..., n} to the vertices of G, such that when each edge of G has assigned a weight, given by the absolute dierence of the labels of its end vertices, the set of weights is {1, 2,..., n}. If a graceful labeling f of a bipartite graph G assigns the smaller labels to one of the two stable sets of G, then f ...
It is known that a graded lattice of rank n is supersolvable if and only if it has an EL-labelling where the labels along any maximal chain are exactly the numbers 1, 2, . . . , n without repetition. These labellings are called Sn EL-labellings, and having such a labelling is also equivalent to possessing a maximal chain of left modular elements. In the case of an ungraded lattice, there is a n...
A graceful labelling of a graph with n edges is a vertex labelling where the induced set of edge weights is {1, . . . , n}. A near graceful labelling is almost the same, the difference being that the edge weights are {1, 2, . . . , n − 1, n + 1}. In both cases, the weight of an edge is the absolute difference between its two vertex labels. Rosa [8] in 1988 conjectured that all triangular cacti ...
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید