The frustration index is a key measure for analysing signed networks, which has been
underused due to its computational complexity. We use an exact optimization-based method …

Fullerene graphs are cubic, 3-connected, planar graphs with exactly 12 pentagonal faces,
while all other faces are hexagons. Fullerene graphs are mathematical models of fullerene …

Let G be a connected graph. Given a set S={v 1,…, vk}⊆ V (G), the metric S-representation
of a vertex v in G is the vector (d G (v, v 1),…, d G (v, vk)) where d G (a, b) is the distance …

The saturation number of a graph $ G $ is the cardinality of any smallest maximal matching
of $ G $, and it is denoted by $ s (G) $. Fullerene graphs are cubic planar graphs with exactly …

Although polyhedra can have much fewer edges than triangulations, many results about
hamiltonicity proven for triangulations also hold for polyhedra. The most famous of these …

A fullerene graph G is a plane cubic graph such that every face is bounded by either a
hexagon or a pentagon. A set H of disjoint hexagons of G is a resonant set (or sextet pattern) …

We analyse signed networks from the perspective of balance theory which predicts structural
balance as a global structure for signed social networks that represent groups of friends and …

Fullerene graphs are cubic planar graphs with only pentagonal and hexagonal faces. They
are used to capture the structure of fullerene molecules. We discuss several graph invariants …

We observe that fullerene graphs are one-skeletons of polyhedra, which can be realized
with all dihedral angles equal to π/2 in a hyperbolic 3-dimensional space. One of the most …

The Smallest Eigenvalue of Fullerene Graphs – Closing the Gap Page 1 The Smallest
Eigenvalue of Fullerene Graphs – Closing the Gap Tomislav Došlic Department of …