the edge szeged index of one–pentagonal carbon nanocones

نویسندگان

a. r. ashrafi

f. gholami-nezhaad

چکیده

the edge szeged index is a new molecular structure descriptor equal to the sum of products mu(e)mv(e) over all edges e = uv of the molecular graph g, where mu(e) is the number of edges which its distance to vertex u is smaller than the distance to vertex v, and nv(e) is defined analogously. in this paper, the edge szeged index of one-pentagonal carbon nanocone cnc5[n] is computed for the first time.

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

The Edge Szeged Index of One–Pentagonal Carbon Nanocones

The edge Szeged index is a new molecular structure descriptor equal to the sum of products mu(e)mv(e) over all edges e = uv of the molecular graph G, where mu(e) is the number of edges which its distance to vertex u is smaller than the distance to vertex v, and nv(e) is defined analogously. In this paper, the edge Szeged index of one-pentagonal carbon nanocone CNC5[n] is computed for the first ...

متن کامل

On the revised edge-Szeged index of graphs

The revised edge-Szeged index of a connected graph $G$ is defined as Sze*(G)=∑e=uv∊E(G)( (mu(e|G)+(m0(e|G)/2)(mv(e|G)+(m0(e|G)/2) ), where mu(e|G), mv(e|G) and m0(e|G) are, respectively, the number of edges of G lying closer to vertex u than to vertex v, the number of ed...

متن کامل

Edge Szeged Index of Unicyclic Graphs

The edge Szeged index of a connected graph G is defined as the sum of products mu(e|G)mv(e|G) over all edges e = uv of G, where mu(e|G) is the number of edges whose distance to vertex u is smaller than the distance to vertex v, and mv(e|G) is the number of edges whose distance to vertex v is smaller than the distance to vertex u. In this paper, we determine the n-vertex unicyclic graphs with th...

متن کامل

The Vertex PI, Szeged and Omega Polynomials of Carbon Nanocones CNC4[n]

A topological index of a graph G is a numeric quantity related to G which is invariant under automorphisms of G. A new counting polynomial, called the "Omega" W(G, x) polynomial, was recently proposed by Diudea on the ground of quasi-orthogonal cut "qoc" edge strips in a polycyclic graph. In this paper, the vertex PI, Szeged and omega polynomials of carbon nanocones CNC4[n] are computed.

متن کامل

Total Szeged Index, Vertex-Edge Wiener Index and Edge Hyper-Wiener Index of Certain Special Molecular Graphs

In past years, topological indices are introduced to measure the characters of chemical molecules. Thus, the study of these topological indices has raised large attention in the field of chemical science, biology science and pharmaceutical science. In this paper, by virtue of molecular structure analysis, we determine the total Szeged index, vertex-edge Wiener index and edge hyper-Wiener index ...

متن کامل

PI, Szeged and Edge Szeged Polynomials of a Dendrimer Nanostar

Let G be a graph with vertex and edge sets V(G) and E(G), respectively. As usual, the distance between the vertices u and v of a connected graph G is denoted by d(u,v) and it is defined as the number of edges in a minimal path connecting the vertices u and v. Throughout the paper, a graph means undirected connected graph without loops and multiple edges. In chemical graph theory, a molecular gr...

متن کامل

منابع من

با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید


عنوان ژورنال:
international journal of nanoscience and nanotechnology

ناشر: iranian nano society

ISSN 1735-7004

دوره 4

شماره 1 2008

میزبانی شده توسط پلتفرم ابری doprax.com

copyright © 2015-2023