【摘 要】
：
A molecular graph is a graph with vertices as atoms of a molecule M and edges are chemical bonds of M.A graph is called tri-connected,if there does not exis
【机 构】
：
DepartmentofPureMathematics,FacultyofMathematicalSciences,UniversityofKashan,Kashan87317-53153,I.R.I
【出 处】
：
The 12th Meeting of the International Academy of Mathematica
论文部分内容阅读
A molecular graph is a graph with vertices as atoms of a molecule M and edges are chemical bonds of M.A graph is called tri-connected,if there does not exist two vertices whose removal disconnects the graph.A(k,6)-fullerene graph is a cubic,planar and tri-connected graph whose faces are all k-gons or hexagons.
其他文献
An automorphism of a graph G =(V,E)is a bijective map φ from V to itself such that φ(vi)φ(vj)∈ E(=)vivj∈ E for any two vertices vi and vj of G.Denote b
The energy levels and binding energies of hydrogenic impurity associated with the ground state and some low-lying states in GaAs/AlGaAs core/shell quantum d
对于连锁门店企业而言，销售量与客流量成直接的正比关系，因此客流量是一个非常重要的商业指标，采集准确的客流数据成为衡量连锁门店运营成败的重要指标，本文探讨目前常用的数
In the mathematical and chemical literature,over a thousand graph invariants have appeared and are considered,claimed to be topological indices,i.e.,molecul
Given a connected surface F2 with Euler characteristic x and three integers b > a ≥ 1 < k,an({a,b}; k)-F2 is a F2-embedded graph,having vertices of degree
Let G be a graph and let P={V1,…,Vk} be a partition of V(G).Setting fP(v)=i for v ∈ Vi,the Wiener index W(G)of G can be decomposed as(W(G)=Σ{u,v}fP(u)=fP
We have selected three topics among solved and unsolved problems of structural chemistry to be considered in this lecture.The first is topic on aromaticity,
I will introduce the concept of a matrix function.Then,starting from a tightbinding model,i.e.,Huckel molecular orbital method,I will show how the use of ma
In supramolecular chemistry,self-assembly of shell(equicentric spherical)structures are found([MacGillivray12],molecular sphere[Chand et al.02]).To study th
The Hermitian adjacency matrix of digraphs will be introduced.Its main difference from the usual adjacency matrix is that it is Hermitian and thus its eigen