نتایج جستجو برای: molecular graphs

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

2009
Sandeep Kaur Rinkle Aggarwal

..........................................................................................iii Table of contents.................................................................................iv List of Figures.................................................................................viii List of Tables......................................................................................x...

Journal: :Journal of Biomedicine and Biotechnology 2009

2007
Leander Schietgat Jan Ramon Maurice Bruynooghe

Graphs are mathematical structures that are capable of representing relational data. In the chemoinformatics context, they have become very popular for the representation of molecules. However, a lot of operations on graphs are NP-complete, so no efficient algorithms that can handle these structures exist. In this paper we focus on outerplanar graphs, a subclass within general graphs. Most mole...

Journal: :Journal of the Serbian Chemical Society 2008

Journal: :Kragujevac Journal of Science 2016

2007
Dragan Maru

Symmetric properties of some molecular graphs on the torus are studied. In particular we determine which cubic cyclic Haar graphs are 1-regular, which is equivalent to saying that their line graphs are 1 2-arc-transitive. Although these symmetries make all vertices and all edges indistinguishable , they imply intrinsic chirality of the corresponding molecular graph.

Journal: :bulletin of the iranian mathematical society 2015
i. ahmad p. m. higgins

bandwidth labelling is a well known research area in graph theory. we provide a new proof that the bandwidth of mobius ladder is 4, if it is not a $k_{4}$, and investigate the bandwidth of a wider class of mobius graphs of even strips.

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

همچنین با استفاده از نتیجه های به دست آمده الگوریتم هایی برای امتحان یکتایی رنگ پذیری ارائه داده شد. به عنوان یک کاربرد، مثال نقضی را برای حدس ژو، مربوط به ‎3-‎رنگ پذیری یکتای گراف های بدون مثلث بررسی می کنیم ‎ایده ی اصلی این پایان نامه از مقاله ‎‎c‎. ‎hillar‎, ‎t‎. ‎windfeldt‎, ‎it algebraic characterization of uniquely vertex colorable graphs, ‎j‎. ‎combin‎. ‎theory ser‎. ‎b 98 (2008) 400...

‎The first multiplicative Zagreb index $Pi_1(G)$ is equal to the‎ ‎product of squares of the degree of the vertices and the second‎ ‎multiplicative Zagreb index $Pi_2(G)$ is equal to the product of‎ ‎the products of the degree of pairs of adjacent vertices of the‎ ‎underlying molecular graphs $G$‎. ‎Also‎, ‎the multiplicative sum Zagreb index $Pi_3(G)$ is equal to the product of‎ ‎the sum...

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

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