S. Filipovski

activity

20162025

most citedOn a problem of Bermond and Bollobás

2 citations · 2 across the 3 of their papers we have counts for

collaborators

4 papers

math.CO2025

There are no excess one digraphs

Slobodan Filipovski, Arnau Messegué, Josep M. Miret +1

A digraph $G$ is \emph{ $k$ -geodetic} if for any pair $u, v \in V (G)$ there is at most one $u, v$ -walk of length not exceeding $k$ . The order of a $k$ -geodetic digraph with minimum ou…

math.CO2018★ 2 cited

On a problem of Bermond and Bollobás

Slobodan Filipovski, Robert Jajcay

Let $n (k, d)$ be the order of the largest undirected graphs of maximum degree $k$ and diameter $d$ , and let $M (k, d)$ be the corresponding Moore bound. In this paper, we give a posi…

math.CO2017

Non-existence of antipodal cages of even girth

Slobodan Filipovski

The Moore bound $M (k, g)$ is a lower bound on the order of $k$ -regular graphs of girth $g$ (denoted $(k, g)$ -graphs). The excess $e$ of a $(k, g)$ -graph of order $n$ is the difference…

math.CO2016

On bipartite cages of excess 4

Slobodan Filipovski

The Moore bound $M (k, g)$ is a lower bound on the order of $k$ -regular graphs of girth $g$ (denoted $(k, g)$ -graphs). The excess $e$ of a $(k, g)$ -graph of order $n$ is the difference…