نتایج جستجو برای: degree in graphs
تعداد نتایج: 17022839 فیلتر نتایج به سال:
in chapter one we will describe definitions and preliminary results to provide the global context of our own results to be presented in detail in the subsequent chapters in chapter two we consider degree-one maps of the circle and we study their rotation set. our main result in this chapter says that if the map is topologically mixing then its rotation interval is nontrivial (that is, not reduc...
in this study, the relationship between teachers’ creative and critical thinking skills and their reflectivity in teaching was investigated. to this end, three questions were raised. these questions were intended to determine whether there was a significant relationship between teachers’ creative thinking skills and their reflectivity in teaching; whether there was a significant relationship be...
In this paper, we determine the degree distance of the complement of arbitrary Mycielskian graphs. It is well known that almost all graphs have diameter two. We determine this graphical invariant for the Mycielskian of graphs with diameter two.
In general, computation of graph vulnerability parameters is NP-complete. In past, some algorithms were introduced to prove that computation of toughness, scattering number, integrity and weighted integrity parameters of interval graphs are polynomial. In this paper, two different vulnerability parameters of graphs, tenacity and rupture degree are defined. In general, computing the tenacity o...
چکیده هدف اصلی این پژوهش شناسایی الزامات نظام مدیریت کیفیت فراگیر در حوزه پژوهشی دانشگاه اصفهان بود. سوالهای پژوهش با توجه به مولفه های مدیریت کیفیت (تعهد مدیران، بهبود مستمر فرایندها ، مشتری محوری ، منابع انسانی ، مدیریت اطلاعات ، زیرساختهای کیفیت ، استفاده از نتایج ، انعطاف پذیری، مشارکت در فعالیتهای پژوهشی، ایجاد فرهنگ کیفیت و تناسب ساختارهای سازمانی) که بر اساس مطالعه استانداردهای بین المل...
A graph is called supermagic if there is a labeling of edges where the edges are labeled with consecutive distinct positive integers such that the sum of the labels of all edges incident with any vertex is constant. A graph G is called degree-magic if there is a labeling of the edges by integers 1, 2, ..., |E(G)| such that the sum of the labels of the edges incident with any vertex v is equal t...
in this paper, we determine the degree distance of the complement of arbitrary mycielskian graphs. it is well known that almost all graphs have diameter two. we determine this graphical invariant for the mycielskian of graphs with diameter two.
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید