نتایج جستجو برای: graceful labellings
تعداد نتایج: 1772 فیلتر نتایج به سال:
Motivated by brane cosmology we solve the Einstein equations with a time dependent cosmological constant. Assuming that at an early epoch the vacuum energy scales as 1/logt, we show that the universe passes from a fast growing phase (inflation) to an expanding phase in a natural way.
The aim of this paper is to present some odd graceful graphs. In particular we show that an odd graceful labeling of the all subdivision of double triangular snakes ( 2 k ∆ -snake ). We also prove that the all subdivision of 2 1 m∆ -snake are odd graceful. Finally, we generalize the above two results (the all subdivision of 2 k m∆ -snake are odd graceful).
The objective of this paper is to present a new class of odd graceful graphs. In particular, we show that the linear cyclic snakes (1, k) C4snake and (2, k) C4snake are odd graceful. We prove that the linear cyclic snakes (1, k) C6snake and (2, k) C6snake are odd graceful. We also prove that the linear cyclic snakes (1, k) C8snake and (2, k) C8snake are odd graceful. We generalize the above res...
A (simple undirected) graph G = (V,E) with m edges is graceful if it has a distinct vertex labeling f : V −→ {0, 1, 2, 3, . . . ,m} which induces a set of distinct edge labels {|f(u)− f(v)| | uv ∈ E, u, v ∈ V }. The famous Ringel-Kotzig conjecture [9, 15] is that all trees are graceful. The base of a tree T is obtained from T by deleting its one-degree vertices. A caterpillar is a tree whose ba...
The 1-2-3 Conjecture states that every connected graph different from K2 admits a proper 3-(edge-)labelling, i.e., can have its edges labelled with 1,2,3 so no two adjacent vertices are incident to the same sum of labels. In connection some recent optimisation variants this conjecture, in paper we investigate role label 3 3-labellings graphs. An intuition previous investigations is that, genera...
In this article, we adapt the edge-graceful graph labeling definition into block designs and define a design V , B with id="M2"> open="|" close="|" = v id="M3"> b as block-graceful if there exists bijection ...
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید