نتایج جستجو برای: Graceful valuations
تعداد نتایج: 5371 فیلتر نتایج به سال:
A set-valuation of a graph G = (V, E) assigns to the vertices or edges of G elements of the power set X 2 of a given nonempty set X subject to certain conditions and set-valuations have a variety of origins. Acharya defined a set-indexer of G to be an injective set-valuation X G V f 2 ) ( : → such that the induced set-valuation ) ( : G E f ⊕ X 2 → on the edges of G defined by ) ( ), ( ) ( ) ( G...
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 ...
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 ...
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...
In this paper, we study pseudo-valuations on a BCI-algebra and obtain some related results. The relation between pseudo-valuations and ideals is investigated. We use a pseudo-metric induced by a pseudovaluation to introduce a congruence relation on a BCI-algebra. We define the quotient algebra induced by this relation and prove that it is also a BCI-algebra and study its properties.
We exhibit a graceful labelling for each generalised Petersen graph P8t,3 with t ≥ 1. As an easy consequence, we obtain that for any fixed t the corresponding graph is the unique starter graph for a cyclic edgedecomposition of the complete graph K2t+1. Due to its extreme versatility, the technique employed looks promising for finding new graceful labellings, not necessarily involving generalise...
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید