نتایج جستجو برای: topological indices

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

Journal: :iranian journal of mathematical chemistry 2010
m. tavakoli h. yousefi–azari

let g and h be two graphs. the corona product g o h is obtained by taking one copy of gand |v(g)| copies of h; and by joining each vertex of the i-th copy of h to the i-th vertex of g,i = 1, 2, …, |v(g)|. in this paper, we compute pi and hyper–wiener indices of the coronaproduct of graphs.

Let $G$ be a connected graph, and let $D[G]$ denote the double graph of $G$. In this paper, we first derive closed-form formulas for different distance based topological indices for $D[G]$ in terms of that of $G$. Finally, as illustration examples, for several special kind of graphs, such as, the complete graph, the path, the cycle, etc., the explicit formulas for some distance based topologica...

Journal: :Molecules 2004
Dan Ciubotariu Mihai Medeleanu Vicentiu Vlaia Tudor Olariu Ciprian Ciubotariu Dan Dragos Seiman Corina

A comparative study of 36 molecular descriptors derived from the topological distance matrix and van der Waals space is carried out within this paper. They are partitioned into 16 generalized topological distance matrix indices, 11 topological distance indices known in the literature (seven obtained from eigenvalues/eigenvectors of distance matrix), and 9 van der Waals molecular descriptors. Th...

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...

Recently two new degree concepts have been defined in graph theory: ev-degree and ve-degree. Also the evdegree and ve-degree Zagreb and Randić indices have been defined very recently as parallel of the classical definitions of Zagreb and Randić indices. It was shown that ev-degree and ve-degree topological indices can be used as possible tools in QSPR researches . In this paper we d...

2018
Imran Nadeem Hani Shaker

Inequalities provide a way to study topological indices relatively. There are two major classes of topological indices: degree-based and distance-based indices. In this paper we provide a relative study of these classes and derive inequalities between degree-based indices such as Randić connectivity, GA, ABC, and harmonic indices and distance-based indices such as eccentric connectivity, connec...

A. AZAD G. FATH–TABAR N. ELAHINEZHAD

Topological indices are numerical parameters of a graph which characterize its topology. In this paper the PI, Szeged and Zagreb group indices of the tetrameric 1,3–adamantane are computed.

2009
ROBERT YUNCKEN

We formulate and prove the special case of Serre duality involved in the Borel-Bott-Weil theorem in the language of equivariant Kasparov theory. The method is to combine the Atiyah-Singer index theorem and the framework of equivariant correspondences developed in another paper by the first author and Ralf Meyer. The twisted Dolbeault cohomology groups of the flag variety figuring in the Borel-B...

2017
Muhammad Imran Shakila Baby Hafiz Muhammad Afzal Siddiqui Muhammad Kashif Shafiq

Topological indices are the mathematical tools that correlate the chemical structure with various physical properties, chemical reactivity or biological activity numerically. A topological index is a function having a set of graphs as its domain and a set of real numbers as its range. In QSAR/QSPR study, a prediction about the bioactivity of chemical compounds is made on the basis of physico-ch...

Journal: :iranian journal of mathematical chemistry 2014
m. ghorbani m. songhori

the chromatic number of a graph g, denoted by χ(g), is the minimum number of colors such that g can be colored with these colors in such a way that no two adjacent vertices have the same color. a clique in a graph is a set of mutually adjacent vertices. the maximum size of a clique in a graph g is called the clique number of g. the turán graph tn(k) is a complete k-partite graph whose partition...

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

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