نتایج جستجو برای: magic f
تعداد نتایج: 315820 فیلتر نتایج به سال:
A vertex-magic total labeling of a graph G(V; E) is a one-to-one map from E ∪V onto the integers {1; 2; : : : ; |E|+ |V |} such that (x) + ∑ (xy); where the sum is over all vertices y adjacent to x, is a constant, independent of the choice of vertex x. In this paper we examine the existence of vertex-magic total labelings of trees and forests. The situation is quite di9erent from the conjecture...
As everyone matures past the age of the twenties, the body begins to change. There has been a drive for the fountain of youth as long as we have had a recorded history. Since there is no such magic bullet, it is prudent to look at the functioning of the body to determine what are the controlling factors relating to deterioration with age. The same factors that are influenced by age are, not sur...
We study the capability of the MAGIC telescope to observe under moderate
where E(v) is the set of edges that have v as an end-point. The total labelling λ of G is vertex-magic if every vertex has the same weight, and the graph G is vertexmagic if a vertex-magic total labelling of G exists. Magic labellings of graphs were introduced by Sedlácěk [5] in 1963, and vertex-magic total labellings first appeared in 2002 in [4]. For a dynamic survey of various forms of graph...
The fluorination mechanism of low-level fluorinated materials obtained by calcination Bayer gibbsite at different temperatures was studied 27Al and 19F solid-state NMR spectroscopy X-ray diffraction. Gibbsite calcined 400, 600, 800, 1000 °C followed treatment with anhydrous HF/N2 gas 100 °C. Three types Al–F species on the surface 800 are proposed basis magic angle spinning (MAS) spectra, which...
This paper describes techniques in computational creativity, blending mathematical modeling and psychological insight, to generate new magic tricks. The details of an explicit computational framework capable of creating new magic tricks are summarized, and evaluated against a range of contemporary theories about what constitutes a creative system. To allow further development of the proposed sy...
The concept of fuzzy magic labeling is introduced.Fuzzy magic labeling for some graphs like path, cycle and star graph are defined. It is proved that, every fuzzy magic graph is a fuzzy labeling graph, but the converse is not true. And we show that the removal of a fuzzy bridge from a fuzzy magic graph G, such that G* is a cycle with odd number of nodes is a fuzzy magic graph.And also some prop...
A graph is magic if the edges can be labeled with nonnegative real numbers such that (i) different edges have distinct labels, and (ii) the sum of the labels of edges incident to each vertex is the same. Regular magic graphs are characterized herein by the nonappearance of certain bipartite subgraphs. This implies that line connectivity is a crucial property for characterizing regular magic gra...
A magic square is an n × n array of distinct positive integers whose sum along any row, column, or main diagonal is the same number. We compute the number of such squares for n = 4, as a function of either the magic sum or an upper bound on the entries. The previous record for both functions was the n = 3 case. Our methods are based on inside-out polytopes, i.e., the combination of hyperplane a...
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید