Pajek – Analysis and Visualization of Large Networks Page 1 Pajek – Analysis and
Visualization of Large Networks Vladimir Batagelj1 and Andrej Mrvar2 1 Department of …

There are several reasons why nanotechnology is currently considered as the leader among
the most intensively develo** research trends. Nanomatter often exhibits new properties …

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 …

Sažetak A map M is a combinatorial representation of a closed surface. Convex polyhedra,
starting from the Platonic solids and going to spherical fullerenes, can be operated to obtain …

A graph is said to be cyclically k-edge-connected, if at least k edges must be removed to
disconnect it into two components, each containing a cycle. Such a set of k edges is called a …

Novel carbon allotropes, such as spherical fullerenes and nanotubes, have been added, in
the last three decades, to the traditionally recognised diamond and graphite. Although …

Sadhana polynomial is defined on the ground of quasi orthogonal cut qoc strips in a graph
𝐺= 𝐺 (𝑉, 𝐸). A qoc strip, defined with respect to any edge in 𝐺, represents the smallest …

Fullerene polyhedra of icosahedral symmetry have the midpoints of their 12 pentagonal
faces at the vertices of a macroicosahedron and can be characterized by the patterns of their …

A topological index for a molecular graph is a number correlated some physic-chemical
properties of the molecule under consideration. The Wiener index is the first reported …

ABSTRACT The 1-, 2-, and 3-dimensional structures obtained from conjugated rings of
carbon atoms are reviewed. They include finite small and large molecules (benzenoids …