43 citations · 51 across the 5 of their papers we have counts for
5 papers · 1 filter
Computing Hosoya polynomials of graphs from primary subgraphs
Emeric Deutsch, Sandi Klavzar
The Hosoya polynomial of a graph encompasses many of its metric properties, for instance the Wiener index (alias average distance) and the hyper-Wiener index. An expression is obta…
Moore graphs and cycles are extremal graphs for convex cycles
Jernej Azarija, Sandi Klavžar
Let denote the number of convex cycles of a simple graph G of order n, size m, and girth 3 <= g <=n. It is proved that and that equality holds…
Domination game played on trees and spanning subgraphs
Bostjan Bresar, Sandi Klavzar, Douglas F. Rall
The domination game is played on a graph G. Vertices are chosen, one at a time, by two players Dominator and Staller. Each chosen vertex must enlarge the set of vertices of G domin…
Tensor 2-sums and entanglement
Sandi Klavzar, Simone Severini
To define a minimal mathematical framework for isolating some of the characteristic properties of quantum entanglement, we introduce a generalization of the tensor product of graph…
The Fibonacci dimension of a graph
Sergio Cabello, David Eppstein, Sandi Klavzar
The Fibonacci dimension fdim(G) of a graph G is introduced as the smallest integer f such that G admits an isometric embedding into Gamma_f, the f-dimensional Fibonacci cube. We gi…