Let G be a molecular graph. The eccentric connectivity index ξc (G) is defined as ξc (G)=∑
u∈ V (G) degG (u) εG (u), where degG (u) denotes the degree of vertex u and εG (u) is the …

After several ad hoc proposals of new 2-dimensional carbon structures, interest in their
actual synthesis has begun to increase. One needs a clear orientation or criteria to describe …

A geometric fullerene, or simply a fullerene, is the surface of a simple closed convex 3-
dimensional polyhedron with only 5-and 6-gonal faces. Fullerenes are geometric models for …

In the present paper, we propose a new discrete surface theory on 3-valent embedded
graphs in the 3-dimensional Euclidean space which are not necessarily “discretization” or …

The symmetries of cubic polyhedral graphs with face size no larger than 6 Page 1 The
symmetries of cubic polyhedral graphs with face size no larger than 6 Michel Deza∗, École …

Topological crystallography, which was pioneered by Motoko Kotani and Toshikazu Sunada
in 2000, describes crystal structures using graph theory and variational principles. One of …

The formation of polyhedra has attracted much interest as an attractive research topic that is
connected with chemistry. In this paper, we focus on the grow law of so-called Goldberg …

Abstract Given R ⊂ N, an (R, k)-sphere is ak-regular map on the sphere whose faces have
gonalities i∈ R. The most interesting/useful are (geometric) fullerenes, that is,(5, 6, 3) …

Двумерная поверхность называется неукорачиваемой, если она не содержит поясов–
простых циклов, состоящих из 6-угольников, каждый из которых смежен с соседями по …