نتایج جستجو برای: etvos number
تعداد نتایج: 1168336 فیلتر نتایج به سال:
<span lang="EN-US">Mentally retarded is a mental disorder with an intelligence quotient (IQ) between 55-70, besides those mentally children are only able to think concretely. For this reason, learning mathematics for students requires media that can bridge abstract mathematical material the abilities of who The objective study was improve recognition 1-20 numbers using number cards mild r...
let $g=(v, e)$ be a graph with $p$ vertices and $q$ edges. an emph{acyclic graphoidal cover} of $g$ is a collection $psi$ of paths in $g$ which are internally-disjoint and cover each edge of the graph exactly once. let $f: vrightarrow {1, 2, ldots, p}$ be a bijective labeling of the vertices of $g$. let $uparrow!g_f$ be the directed graph obtained by orienting the...
عرفان طریق? معرفت نزد آن دسته از صاحب نظران است که برخلاف اهل برهان، در کشف حقیقت بر ذوق و اشراق، بیشتر اعتماد دارند. از دیرباز عرفا و صوفیان برای برخی کارها و دستورالعمل ها از بعضی اعداد استفاده های ویژه ای می نمودند و اعدادی مانند هفت، چهل، هفتاد و... درتعالیم عرفانی آنان نقش تعیین کننده ای داشت. هفت مرحله سیر و سلوک عطار، چله نشینی های عرفا، در طول روز هفتاد بار استغفار کردن آنان و ... حاکی ...
Researchers are often perplexed when their machine learning algorithms are required to deal with complex number. Various strategies are commonly employed to project complex number into real number, although it is frequently sacrificing the information contained in the complex number. This paper proposes a new method and four techniques to represent complex number as real number, without having ...
The distinguishing number $D(G)$ of a graph $G$ is the least integer $d$ such that $G$ has a vertex labeling with $d$ labels that is preserved only by a trivial automorphism. The distinguishing chromatic number $chi_{D}(G)$ of $G$ is defined similarly, where, in addition, $f$ is assumed to be a proper labeling. We prove that if $G$ is a bipartite graph of girth at least six with the maximum ...
In the mathematical analysis, there are some theorems and definitions that established for both real and fuzzy numbers. In this study, we try to prove Bernoulli's inequality in fuzzy real numbers with some of its applications. Also, we prove two other theorems in fuzzy real numbers which are proved before, for real numbers.
The crossing number crðGÞ of a graph G is the minimum possible number of edge crossings in a drawing of G in the plane, while the pair-crossing number pcrðGÞ is the smallest number of pairs of edges that cross in a drawing of G in the plane. While crðGÞXpcrðGÞ holds trivially, it is not known whether a strict inequality can ever occur (this question was raised by Mohar and Pach and Tóth). We ai...
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید