نتایج جستجو برای: equitable self

تعداد نتایج: 533692  

Journal: :University of Pennsylvania Law Review and American Law Register 1910

Journal: :American Journal of Public Health 2005

پایان نامه :وزارت بهداشت، درمان و آموزش پزشکی - دانشگاه علوم پزشکی و خدمات بهداشتی درمانی مشهد - دانشکده دندانپزشکی 1390

objective: the objective of this study was to investigate the invitro fluoride release of four new self-adhesive resin cements; set (sdi, australia), breeze (pentron, usa), embrace wetbond (pulpdent, usa), g-cem (gc, japan) and to assess the bonding performance of these self-adhesive resin cements for bonding of orthodontic brackets. materials and methods: for fluoride release experiment, six ...

Journal: :Australasian J. Combinatorics 1999
Michael Edwin Raines Zsuzsanna Szaniszló

In this paper, we give necessary and sufficient conditions for the existence of equitable partial 4-cycle and 5-cycle systems. Furthermore, we construct equitable partial 4-cycle and 6-cycle systems of Kn,n'

پایان نامه :وزارت علوم، تحقیقات و فناوری - دانشگاه تربیت دبیر شهید رجایی - دانشکده علوم انسانی 1393

according to research, academic self-concept and academic achievement are mutually interdependent. in the present study, the aim was to determine the relationship between the academic self-concept and the academic achievement of students in english as a foreign language and general subjects. the participants were 320 students studying in 4th grade of high school in three cities of noor, nowshah...

2009
Kiran Kate Balaraman Ravindran

Positional analysis is considered an important tool in the analysis of social networks. It involves partitioning of the set of actors into subsets such that actors in a subset are similar in their structural relationships with other actors. Traditional methods of positional analysis such as structural equivalence, regular equivalence, and equitable partitions are either too strict or too generi...

Journal: :Discussiones Mathematicae Graph Theory 2017
Hanna Furmanczyk Marek Kubale Vahan V. Mkrtchyan

A graph is equitably k-colorable if its vertices can be partitioned into k independent sets in such a way that the number of vertices in any two sets differ by at most one. The smallest k for which such a coloring exists is known as the equitable chromatic number of G and denoted χ=(G). It is known that this problem is NP-hard in general case and remains so for corona graphs. In [12] Lin i Chan...

Journal: :Bond Law Review 2014

Journal: :Graphs and Combinatorics 2018

نمودار تعداد نتایج جستجو در هر سال

با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید