#### Filter Results:

- Full text PDF available (22)

#### Publication Year

1969

2017

- This year (2)
- Last 5 years (13)
- Last 10 years (20)

#### Publication Type

#### Co-author

#### Journals and Conferences

#### Key Phrases

Learn More

- Aleksander Vesel, Janez Zerovnik
- Inf. Process. Lett.
- 2002

- Sandi Klavzar, Aleksander Vesel, Petra Zigert, Ivan Gutman
- Computers & Chemistry
- 2001

An algorithm is described by means of which the Kekulé structures of a catacondensed benzenoid molecule (with h hexagons) are transformed into binary codes (of length h). By this, computer-aided manipulations with, and memory-storage of Kekulé structures are much facilitated. Any Kekulé structure can easily be recovered from its binary code.

- Sandi Klavzar, Aleksander Vesel
- Discrete Applied Mathematics
- 2003

Rotagraphs generalize all standard products of graphs in which one factor is a cycle. A computer based approach for searching graph invariants on rotagraphs is proposed and two of its applications are presented. First, the-numbers of the Cartesian product of a cycle and a path are computed, where the-number of a graph G is the minimum number of colors… (More)

- Andrej Taranenko, Aleksander Vesel
- Algorithmica
- 2007

Fibonacci cubes are induced subgraphs of hypercubes based on Fibonacci strings. They were introduced to represent interconnection networks as an alternative to the hypercube networks. We derive a characterization of Fibonacci cubes founded on the concept of resonance graphs. The characterization is the basis for an algorithm which recognizes these graphs in… (More)

The vertex set of the resonance graph of a hexagonal graph G consists of 1-factors of G, two 1-factors being adjacent whenever their symmetric difference forms the edge set of a hexagon of G. A decomposition theorem for the resonance graphs of catacondensed hexagonal graph is proved. The theorem intrinsically uses the Cartesian product of graphs. A… (More)

- Khaled Salem, Sandi Klavzar, Aleksander Vesel, Petra Zigert
- Discrete Applied Mathematics
- 2009

It is shown that the number of Clar formulas of a Kekuléan benzenoid system B is equal to the number of subgraphs of the resonance graph of B isomorphic to the Cl(B)-dimensional hypercube, where Cl(B) is the Clar number of B.

- Aleksander Vesel
- Discrete Applied Mathematics
- 2013

The Fibonacci dimension fdim(G) of a graph G was introduced in [1] as the smallest integer d such that G admits an isometric embedding into Γd, the d-dimensional Fibonacci cube. The Fibonacci dimension of the resonance graphs of catacondensed benzenoid systems is studied. This study is inspired by the fact, that the Fibonacci cubes are precisely the… (More)

Combinatorial optimization problems arise in situations where discrete choices must be made and solving them amounts to finding an optimal solution among a finite or countably infinite number of alternatives. Optimality relates to some cost criterion, which provides a quantitative measure of the quality of each solution. This area of discrete mathematics is… (More)

- Aleksander Vesel
- Algorithmica
- 2013

Fibonacci strings are binary strings that contain no two consecutive 1s. The Fibonacci cube Γ h is the subgraph of the h-cube induced by the Fibonacci strings. These graphs are applicable as interconnection networks and in theoretical chemistry, and lead to the Fibonacci dimension of a graph. We derive a new characterization of Fibonacci cubes. The… (More)

- Pranava K. Jha, Sandi Klavzar, Aleksander Vesel
- Discrete Applied Mathematics
- 2005

An L(d,1)-labeling of a graph G is an assignment of nonnegative integers to the vertices such that adjacent vertices receive labels that differ by at least d and those at a distance of two receive labels that differ by at least one, where d 1. Let d1 (G) denote the least such that G admits an L(d,1)-labeling using labels from {0, 1, . . . , }. We prove that… (More)