نتایج جستجو برای: sadhana polynomial

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

2013
Sucharit Katyal Alexander Huk Michael Beauchamp Mary Hayhoe

Dedication According to the philosophy of science of Yoga, the quest for Truth is the inherent longing of an individual's mind. The word 'consciousness' in Sanskrit language is known by the terms Purusa or Shiva and is synonymous with such a Truth. What humans through self-reflection refer to as subjectivity or consciousness is actually omnipresent, though most clearly reflected by the human mi...

P. JOHN P. KHADIKAR S. AZIZ

Structural codes vis-a-vis structural counts, like polynomials of a molecular graph, are important in computing graph-theoretical descriptors which are commonly known as topological indices. These indices are most important for characterizing carbon nanotubes (CNTs). In this paper we have computed Sadhana index (Sd) for phenylenes and their hexagonal squeezes using structural codes (counts). Sa...

Journal: :iranian journal of mathematical chemistry 2010
p. e. john s. aziz p. v. khadikar

structural codes vis-a-vis structural counts, like polynomials of a molecular graph, areimportant in computing graph-theoretical descriptors which are commonly known astopological indices. these indices are most important for characterizing carbon nanotubes(cnts). in this paper we have computed sadhana index (sd) for phenylenes and theirhexagonal squeezes using structural codes (counts). sadhan...

Journal: :Journal of Indian and Buddhist Studies (Indogaku Bukkyogaku Kenkyu) 2016

2011
M. GHORBANI

A fullerene graph is a cubic 3-connected plane graph with (exactly 12) pentagonal faces and hexagonal faces. Let Fn be a fullerene graph with n vertices. By the Euler formula one can see that Fn has 12 pentagonal and n/2 – 10 hexagonal faces. Let G = (V, E) be a connected graph with the vertices set V = V(G) and the edges set E = E(G), without loops and multiple edges. The distance d(x,y) betwe...

Journal: :Journal of Analytical Methods in Chemistry 2020

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

امروزه با گسترش تکنولوژی بی سیم و نیاز به برقراری امنیت استفاده از رمزنگاری امری اجتناب ناپذیر می نماید. گروه های تحقیقاتی زیادی تلاش می کنند که سیستم های رمزنگاری ایمن طراحی کنند. اما یک پیاده سازی بد می تواند تمامی این تلاش ها را بیهوده سازد. به همین دلیل در کنار طراحی و تحلیل امنیت سیستم های رمزنگاری، بحث پیاده سازی آن ها در دستور کار گروه های تحقیقاتی قرار می گیرد. در پیاده سازی دو موضوع م...

Journal: :transactions on combinatorics 2012
saeid alikhani mohammad hossein reyhani

let $g$ be a simple graph of order $n$‎. ‎we consider the‎ ‎independence polynomial and the domination polynomial of a graph‎ ‎$g$‎. ‎the value of a graph polynomial at a specific point can give‎ ‎sometimes a very surprising information about the structure of the‎ ‎graph‎. ‎in this paper we investigate independence and domination‎ ‎polynomial at $-1$ and $1$‎.

Journal: :bulletin of the iranian mathematical society 2013
c. brennan t. mansour e. mphako-banda

we find an explicit expression of the tutte polynomial of an $n$-fan. we also find a formula of the tutte polynomial of an $n$-wheel in terms of the tutte polynomial of $n$-fans. finally, we give an alternative expression of the tutte polynomial of an $n$-wheel and then prove the explicit formula for the tutte polynomial of an $n$-wheel.

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

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