ORIGINAL_ARTICLE
Hyperdiamonds: a Topological View
Hyperdiamonds are covalently bonded fullerenes in crystalline forms, more or less related to diamond, and having a significant amount of sp3 carbon atoms. Design of several hypothetical crystal networks was performed by using our original software programs CVNET and NANO-STUDIO. The topology of the networks is described in terms of the net parameters and several counting polynomials, calculated by NANO-STUDIO, OMEGA and PI software programs.
https://ijmc.kashanu.ac.ir/article_5162_9974b6f2617e306680ac7ca9131b449a.pdf
2011-04-01T11:23:20
2020-08-12T11:23:20
7
29
10.22052/ijmc.2011.5162
Hyperdiamond
Crystal-like network
Molecular topology
Counting polynomial
M.
DIUDEA
true
1
“Babes-Bolyai” University, Romania
“Babes-Bolyai” University, Romania
“Babes-Bolyai” University, Romania
AUTHOR
A.
ILIĆ
true
2
University of Niš,
Serbia
University of Niš,
Serbia
University of Niš,
Serbia
AUTHOR
M.
MEDELEANU
true
3
University “Politehnica”
Timisoara, Romania
University “Politehnica”
Timisoara, Romania
University “Politehnica”
Timisoara, Romania
AUTHOR
ORIGINAL_ARTICLE
Evaluation of the Mineral Contents in Fish Meal by FT- NIR using PLS and Kernel PLS
In the present work we study the use of Fourier transform near infrared spectroscopy (FTNIRS) technique to analysis the calcium (Ca), phosphorus (P) and copper (Cu) contents of fish meal. The regression methods employed were partial least squares (PLS) and kernel partial least squares (KPLS). The results showed that the efficiency of KPLS was better than PLS. As a whole, the application of FT-NIRS with PLS and KPLS was as a suitable option for replacing the routine chemical analysis to assess the mineral content in fish meal, allowing immediate control of the fish meal without prior sample treatment or destruction.
https://ijmc.kashanu.ac.ir/article_5163_28dfda8b8cd531f153602fa22ca08baa.pdf
2011-04-01T11:23:20
2020-08-12T11:23:20
31
38
10.22052/ijmc.2011.5163
Calcium
Phosphorus
copper
Fish meal
FT-NIRS
KPLS
S.
MASOUM
true
1
University of Kashan,
I. R. IRAN
University of Kashan,
I. R. IRAN
University of Kashan,
I. R. IRAN
AUTHOR
A.
ALISHAHI
true
2
Department of Fisheries and Environmental Science, Tehran University, Karaj, IRAN
Department of Fisheries and Environmental Science, Tehran University, Karaj, IRAN
Department of Fisheries and Environmental Science, Tehran University, Karaj, IRAN
AUTHOR
M.
SHEKARCHI
true
3
Tehran University, IRAN
Tehran University, IRAN
Tehran University, IRAN
AUTHOR
H.
FARAHMAND
true
4
Sanitary Ministry of Iran, IRAN
Sanitary Ministry of Iran, IRAN
Sanitary Ministry of Iran, IRAN
AUTHOR
ORIGINAL_ARTICLE
Eccentric and Total Eccentric Connectivity Indices of Caterpillars
Consider a simple connected graph with the vertex set . The eccentric and total connectivity indices of are defined as Σ and Σ , respectively. Here, denotes the degree of a vertex and is its eccentricity. In this paper, these two indices are calculated for a given arbitrary caterpillar.
https://ijmc.kashanu.ac.ir/article_5164_5eab17f138e0f73210f23c5b0adcbc49.pdf
2011-04-01T11:23:20
2020-08-12T11:23:20
39
44
10.22052/ijmc.2011.5164
eccentric connectivity index
Total eccentricity index
Caterpillar
KH.
FATHALIKHANI
true
1
University of Tehran, Tehran, Iran
University of Tehran, Tehran, Iran
University of Tehran, Tehran, Iran
AUTHOR
H.
YOUSEFI-AZARI
true
2
University of Tehran, Iran
University of Tehran, Iran
University of Tehran, Iran
AUTHOR
ORIGINAL_ARTICLE
Energy and Wiener Index of Zero-Divisor Graphs
Let R be a commutative ring and (R) be its zerodivisor graph. In this article, we study Wiener index and energy of Γ(Zn ) where n = pq or n = p2q and p, q are primes. A MATLAB code for our calculations is also presented.
https://ijmc.kashanu.ac.ir/article_5166_d13709db3d3b7a37193dd283d8f6696f.pdf
2011-04-01T11:23:20
2020-08-12T11:23:20
45
51
10.22052/ijmc.2011.5166
zero-divisor graph
Energy
Wiener index
M.
AHMADI
true
1
University
of Kashan, I. R. Iran
University
of Kashan, I. R. Iran
University
of Kashan, I. R. Iran
AUTHOR
R.
JAHANI-NEZHAD
true
2
University
of Kashan, I. R. Iran
University
of Kashan, I. R. Iran
University
of Kashan, I. R. Iran
AUTHOR
ORIGINAL_ARTICLE
The Clar Number of Fullerene C24n and Carbon Nanocone CNC4[n]
A fullerene graph is a 3−connected planar graph whose faces are pentagons and hexagons. The Clar number of a fullerene is the maximum size of sextet patterns, the sets of disjoint hexagons which are all M-alternating for a Kekulé structure M of F. An exact formula of Clar number of some fullerene graphs and a class of carbon nanocones are obtained in this paper.
https://ijmc.kashanu.ac.ir/article_5168_497b64ea009a4954544694dc1fdc09b7.pdf
2011-04-01T11:23:20
2020-08-12T11:23:20
53
59
10.22052/ijmc.2011.5168
Fullerene
Clar number
Sextet pattern
Carbon Nanotube
Kekulé structure
M.
GHORBANI
true
1
Shahid Rajaee Teacher Training
University, I. R. Iran
Shahid Rajaee Teacher Training
University, I. R. Iran
Shahid Rajaee Teacher Training
University, I. R. Iran
AUTHOR
E.
NASERPOUR
true
2
Shahid Rajaee Teacher Training
University, I. R. Iran
Shahid Rajaee Teacher Training
University, I. R. Iran
Shahid Rajaee Teacher Training
University, I. R. Iran
AUTHOR
ORIGINAL_ARTICLE
The Eccentric Connectivity Index of Some Special Graphs
If is a connected graph with vertex set , then the eccentric connectivity index of , , is defined as Σ deg where deg is the degree of a vertex and is its eccentricity. Let A, B and C are families of graphs made by joining to , made by putting instead of each vertex in and made by putting instead of each vertex in , respectively. In this paper we compute the eccentric connectivity index of these families of graphs.
https://ijmc.kashanu.ac.ir/article_5169_5b44cd85146f77aa944ddc562bf0add2.pdf
2011-04-01T11:23:20
2020-08-12T11:23:20
61
65
10.22052/ijmc.2011.5169
eccentric connectivity index
Graph
M.
IRANMANESH
true
1
Yazd University, Iran
Yazd University, Iran
Yazd University, Iran
AUTHOR
R.
HAFEZIEH
true
2
Yazd University, Iran
Yazd University, Iran
Yazd University, Iran
AUTHOR
ORIGINAL_ARTICLE
Further Results on Wiener Polarity Index of Graphs
The Wiener polarity index Wp(G) of a molecular graph G of order n is the number of unordered pairs of vertices u, v of G such that the distance d(u,v) between u and v is 3. In an earlier paper, some extremal properties of this graph invariant in the class of catacondensed hexagonal systems and fullerene graphs were investigated. In this paper, some new bounds for this graph invariant are presented. A relationship between Wiener and Wiener polarity index of some classes of graphs are also presented.
https://ijmc.kashanu.ac.ir/article_5170_ec5326da713aad93a04c35d905351ba2.pdf
2011-04-01T11:23:20
2020-08-12T11:23:20
67
70
10.22052/ijmc.2011.5170
Fullerene graph
Wiener index
Wiener polarity index
A.
BEHMARAM
true
1
University of Tehran,
I. R. Iran
University of Tehran,
I. R. Iran
University of Tehran,
I. R. Iran
AUTHOR
H.
YOUSEFI-AZARI
true
2
Institute for Research in Fundamental Sciences (IPM), I. R. Iran
Institute for Research in Fundamental Sciences (IPM), I. R. Iran
Institute for Research in Fundamental Sciences (IPM), I. R. Iran
AUTHOR
ORIGINAL_ARTICLE
Hosoya Polynomial of an Infinite Family of Dendrimer Nanostar
Let G be a simple graph. The Hosoya polynomial of G is ( , ) , ( , ) = { , } ( ) xd u v H G x u v V G where d(u,v) denotes the distance between vertices u and v . The dendrimer nanostar is a part of a new group of macromolecules. In this paper we compute the Hosoya polynomial for an infinite family of dendrimer nanostar. As a consequence we obtain the Wiener index and the hyper-Wiener index of this dendrimer.
https://ijmc.kashanu.ac.ir/article_5171_d7afdc71a1f11f23e5c5555ed15965bf.pdf
2011-04-01T11:23:20
2020-08-12T11:23:20
71
79
10.22052/ijmc.2011.5171
Hosoya polynomial
Wiener index
Dendrimer nanostar
diameter
CH.
ESLAHCHI
true
1
Shahid Beheshti University, Iran
Shahid Beheshti University, Iran
Shahid Beheshti University, Iran
AUTHOR
S.
ALIKHANI
true
2
Yazd University, Iran
Yazd University, Iran
Yazd University, Iran
AUTHOR
M.
AKHBARI
true
3
Islamic Azad University, Estahban Branch, Estahban, Iran
Islamic Azad University, Estahban Branch, Estahban, Iran
Islamic Azad University, Estahban Branch, Estahban, Iran
AUTHOR
ORIGINAL_ARTICLE
On the Spectra of Reduced Distance Matrix of Thorn Graphs
Let G be a simple connected graph and {v1, v2, …, vk} be the set of pendent (vertices of degree one) vertices of G. The reduced distance matrix of G is a square matrix whose (i,j)– entry is the topological distance between vi and vj of G. In this paper, we obtain the spectrum of the reduced distance matrix of thorn graph of G, a graph which obtained by attaching some new vertices to pendent vertices of G. As an application we compute the spectrum of reduced distance matrix for some dendrimer graphs.
https://ijmc.kashanu.ac.ir/article_5172_53f42679383c642229cfeea0f630e490.pdf
2011-04-01T11:23:20
2020-08-12T11:23:20
81
87
10.22052/ijmc.2011.5172
Reduced distance matrix
spectrum
Thorn graph
Dendrimer graphs
A.
HEYDARI
true
1
Arak Branch, Islamic Azad University, Arak, Iran
Arak Branch, Islamic Azad University, Arak, Iran
Arak Branch, Islamic Azad University, Arak, Iran
AUTHOR
ORIGINAL_ARTICLE
On the General Sum–Connectivity Co–Index of Graphs
In this paper, a new molecular-structure descriptor, the general sum–connectivity co–index is considered, which generalizes the first Zagreb co–index and the general sum– connectivity index of graph theory. We mainly explore the lower and upper bounds in terms of the order and size for this new invariant. Additionally, the Nordhaus–Gaddum–type result is also represented.
https://ijmc.kashanu.ac.ir/article_5173_d154da6922ebac74f4671c7b5af8d008.pdf
2011-04-01T11:23:20
2020-08-12T11:23:20
89
98
10.22052/ijmc.2011.5173
General sum–connectivity co–index
First Zagreb co–index
Lower and upper bounds
G.
SU
true
1
Beijing Institute of Technology, P. R. China
Beijing Institute of Technology, P. R. China
Beijing Institute of Technology, P. R. China
AUTHOR
L.
XU
true
2
Changji University, P. R. China
Changji University, P. R. China
Changji University, P. R. China
AUTHOR
ORIGINAL_ARTICLE
Distance Property of Fullerenes
Fullerenes are closed−cage carbon molecules formed by 12 pentagonal and n/2 – 10 hexagonal faces, where n is the number of carbon atoms. Patrick Fowler in his lecture in MCC 2009 asked about the Wiener index of fullerenes in general. In this paper we respond partially to this question for an infinite class of fullerenes with exactly 10n carbon atoms. Our method is general and can be applied to fullerene graphs with centrosymmetric adjacency matrix.
https://ijmc.kashanu.ac.ir/article_5174_a4f7e3d101aca42bffedccebfe768ede.pdf
2011-04-01T11:23:20
2020-08-12T11:23:20
99
107
10.22052/ijmc.2011.5174
Fullerene
Wiener index
Centrosymmetric matrix
A.
GRAOVAC
true
1
University of Split, Croatia
University of Split, Croatia
University of Split, Croatia
AUTHOR
O.
ORI
true
2
Via Casilina Rome, Italy
Via Casilina Rome, Italy
Via Casilina Rome, Italy
AUTHOR
M.
FAGHANI
true
3
University of Kashan, I. R. Iran
University of Kashan, I. R. Iran
University of Kashan, I. R. Iran
AUTHOR
A.
ASHRAFI
true
4
University of Kashan, I. R. Iran
University of Kashan, I. R. Iran
University of Kashan, I. R. Iran
AUTHOR
ORIGINAL_ARTICLE
Computing Some Topological Indices of Tensor Product of Graphs
A topological index of a molecular graph G is a numeric quantity related to G which is invariant under symmetry properties of G. In this paper we obtain the Randić, geometricarithmetic, first and second Zagreb indices , first and second Zagreb coindices of tensor product of two graphs and then the Harary, Schultz and modified Schultz indices of tensor product of a graph G with complete graph of order n are obtained.
https://ijmc.kashanu.ac.ir/article_5175_c563e2473a6d4006667114ee0582be34.pdf
2011-04-01T11:23:20
2020-08-12T11:23:20
109
118
10.22052/ijmc.2011.5175
topological index
tensor product
Z.
YARAHMADI
true
1
Khorramabad Branch, Islamic Azad University, I. R. Iran
Khorramabad Branch, Islamic Azad University, I. R. Iran
Khorramabad Branch, Islamic Azad University, I. R. Iran
AUTHOR