نتایج جستجو برای: graphing labeling
تعداد نتایج: 58296 فیلتر نتایج به سال:
let g(v,e) be a graph with p vertices and q edges. a graph g is said to have an odd mean labeling if there exists a function f : v (g) → {0, 1, 2,...,2q - 1} satisfying f is 1 - 1 and the induced map f* : e(g) → {1, 3, 5,...,2q - 1} defined by f*(uv) = (f(u) + f(v))/2 if f(u) + f(v) is evenf*(uv) = (f(u) + f(v) + 1)/2 if f(u) + f(v) is odd is a bijection. a graph that admits an odd mean lab...
Two phases of quasi-experimental study with non-equivalent control group posttest only design were conducted to investigate the effects of using graphing calculators in mathematics teaching and learning on Form Four Malaysian secondary school students’ level of metacognitive awareness. Experiment in Phase I was conducted for six weeks to provide an initial indicator of the effectiveness of grap...
We prove that for any weakly convergent sequence of finite graphs with bounded vertex degrees, there exists a topological limit graphing. AMS Subject Classifications: 05C80
The availability of ICT offers opportunities to reconsider teaching and learning in the calculus curriculum. In this paper, some potential contributions of one form of ICT, the hand-held graphics calculator, are described and evaluated. Although algebraic calculators, graphics calculators with symbolic manipulation capabilities, have been available for some years now, attention in the paper is ...
In a climate where the use of calculators is being criticised as one of the reasons for failure in mathematics, this paper explores how graphic calculators can be used to support students’ mathematical development through the processes of visualisation, formalisation and interpretation. It explores the current research through a vignette of one student’s experience and argues for a reconceptual...
The study of linear functions is important as it provides students with their first experience of identifying and interpreting the relationship between two dependent variables. This paper, which builds on previous research, reports a study undertaken with 64, year 9 students from two Australian schools. Linear functions were introduced to these students through a graphics calculator supported, ...
a graph of size n is said to be graceful when is possible toassign distinct integers from {0, 1, . . . , n} to its verticesand {|f(u)−f(v)| : uv ∈ e(g)} consists of n integers. inthis paper we present broader families of graceful graphs; these families are obtained via three different operations: the third power of a caterpillar, the symmetric product of g and k2 , and the disjoint :union: of g...
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید