The aim of this paper is to investigate resonance graphs of 2-connected outerplane bipartite
graphs, which include various families of molecular graphs. Firstly, we present an algorithm …

Applying the recently obtained distributive lattice structure on the set of 1-factors, we show
that the resonance graphs of any benzenoid systems G, as well as of general plane (weakly) …

After a brief history of the aromaticity concept, the use of Clar sextet circles is reviewed for
explaining various aspects of planar aromatic systems (benzenoids, heterocycles) and of …

The resonance graph R (B) of a benzenoid graph B has the perfect matchings of B as
vertices, two perfect matchings being adjacent if their symmetric difference forms the edge …

Klav\v {z} ar and Mollard introduced daisy cubes which are interesting isometric subgraphs
of $ n $-cubes $ Q_n $, induced with intervals between the maximal elements of a poset $(V …

Let d (G, k) be the number of pairs of vertices of a graph G that are at distance k, λ a real (or
complex) number, and Wλ (G)=∑ k≥ 1d (G, k) kλ. It is proved that for a partial cube G, Wλ+ 1 …

Fibonacci cubes are induced subgraphs of hypercubes based on Fibonacci strings. They
were introduced to represent interconnection networks as an alternative to the hypercube …

A catacondensed polyhex H is a connected subgraph of a hexagonal system such that any
edge of H lies in a hexagon of H, any triple of hexagons of H has an empty intersection and …

Let G be a graph embedded in a surface and let be the set of all faces of G. For a given
subset F of even faces (faces bounded by an even cycle), the resonance graph of G with …

In this paper we generalize the binary coding procedure of perfect matchings from
catacondensed benzenoid graphs to catacondensed even ring systems (also called cers) …