نتایج جستجو برای: chemical graph theory
تعداد نتایج: 1277645 فیلتر نتایج به سال:
Graph theory plays an important role for modelling and designing chemical structures complex networks. Chemical graph is commonly used to analyse comprehend networks, as well their features. In theory, a structure can be represented by vertices edges where denote atoms molecular bonds. The concept of resolvability parameters G= (V, E) relatively new advanced field in which the complete built so...
Among various topological indices considered in chemical graph theory, only a few have been widely studied in mathematical and chemical literatures. However, it seems that less attention has been paid to the Wiener polarity index. It was introduced by Harold Wiener1 for acyclic molecules in 1947. The Wiener polarity index of an organic molecule the molecular graph of which is G = (V,E) is defin...
یک متروید دودویی است اگر و تنها اگر هیچ مینوری یکریخت با u2,3 که نمایش هندسی آن یک خط چهار نقطه ای است، نداشته باشد. این قضیه توسط بیکسبای توسیع داده شد، او ثابت کرد که هر عنصری در یک متروید همبند غیردودویی در یک u2,4- مینور قرار دارد. این نتیجه بعدها توسط سیمور توسیع داده شد. او نشان داد که هر جفت از عناصر در یک متروید 3- همبند غیر دودویی در یک u2,4- مینور قرار دارند. در این پایان نامه قضیه سی...
Graph theory based methods are powerful means for representing structural systems so that their geometry and topology can be understood clearly. The combination of graph theory based methods and some metaheuristics can offer effective solutions for complex engineering optimization problems. This paper presents a Charged System Search (CSS) algorithm for the free shape optimizations of thin-wall...
چکیده ندارد.
optimal adaptive leader-follower consensus of linear multi-agent systems: known and unknown dynamics
in this paper, the optimal adaptive leader-follower consensus of linear continuous time multi-agent systems is considered. the error dynamics of each player depends on its neighbors’ information. detailed analysis of online optimal leader-follower consensus under known and unknown dynamics is presented. the introduced reinforcement learning-based algorithms learn online the approximate solution...
task graph scheduling is a multi-objective optimization and np-hard problem. in this paper a new algorithm on homogeneous multiprocessors systems is proposed. basically, scheduling algorithms are targeted to balance the two parameters of time and energy consumption. these two parameters are up to a certain limit in contrast with each other and improvement of one causes reduction in the other on...
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید