نتایج جستجو برای: magic seeds
تعداد نتایج: 54469 فیلتر نتایج به سال:
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...
The limited representation of women in STEM workforce is a concerning national issue. It has been found that the gender stratification is not due to the lack of talent amongst young females, but due to the lack of access to female role models. To this end, “remote mentoring” is an effective way to offer nation-wide personalized STEM mentoring to young females from all segments of the society. I...
In this paper, we generalize the concept of super edge-magic graph by introducing the new concept of super edge-magic models.
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
Let G = (V,E) be a graph of order n. A bijection f : V → {1, 2, . . . , n} is called a distance magic labeling of G if there exists a positive integer k such that ∑ u∈N(v) f(u) = k for all v ∈ V, where N(v) is the open neighborhood of v. The constant k is called the magic constant of the labeling f . Any graph which admits a distance magic labeling is called a distance magic graph. In this pape...
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید