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 developing research trends. Nanomatter often exhibits new properties …

Spongy carbon nanostructures, also called schwarzites, have been synthesized. They
consist of highly connected covalent networks, periodic in the three dimensions of Euclidean …

A topological index is a real number related to the structure of a connected graph G and is
invariant under graph automorphism. Let G be a (molecular) graph possessing n vertices …

Let G be a simple connected molecular graph in chemical graph theory, then its vertices
correspond to the atoms and the edges to the bonds. Throughout this paper, we denoted …

Let G=(V, E) be a simple connected graph. The sets of vertices and edges of G are denoted
by V= V (G) and E= E (G), respectively. In such a simple molecular graph, vertices represent …

A perfect star packing in a graph G is a spanning subgraph of G whose every component is
isomorphic to the star graph K_ 1, 3 K 1, 3. We investigate which fullerene graphs allow such …

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 …

Let G=(V, E) be a simple connected molecular graph. In such a simple molecular graph,
vertices represent atoms and edges represent chemical bonds, we denoted the sets of …

In this review article, four ideas are discussed:(a) aromaticity of fullerenes patched with
flowers of 6-and 8-membered rings, optimized at the HF and DFT levels of theory, in terms of …