activity
20072024
most citedMixed connectivity of Cartesian graph products and bundles

6 citations · 10 across the 6 of their papers we have counts for

collaborators

7 papers

math.CO2024

The 2-rainbow domination number of Cartesian product of cycles

Simon Brezovnik, Darja Rupnik Poklukar, Janez Žerovnik

A -rainbow dominating function (RDF) of is a function that assigns subsets of to the vertices of such that for vertices with we…

cs.DS2016

Weighted domination number of cactus graphs

Tina Novak, Janez Zerovnik

In the paper, we write a linear algorithm for calculating the weighted domination number of a vertex-weighted cactus. The algorithm is based on the well known depth first search (D…

cs.OH2016★ 3 cited

Using Newton's method to model a spatial light distribution of a LED with attached secondary optics

David Kaljun, Joze Petrišič, Janez Žerovnik

In design of optical systems based on LED (Light emitting diode) technology, a crucial task is to handle the unstructured data describing properties of optical elements in standard…

math.CO2013

Multicoloring of cannonball graphs

Petra Sparl, Rafal Witkowski, Janez Zerovnik

The frequency allocation problem that appeared in the design of cellular telephone networks can be regarded as a multicoloring problem on a weighted hexagonal graph, which opened s…

math.CO2010★ 6 cited

Mixed connectivity of Cartesian graph products and bundles

Rija Erves, Janez Zerovnik

Mixed connectivity is a generalization of vertex and edge connectivity. A graph is -connected, , if the graph remains connected after removal of any vertices. A g…

math.CO2008

(l,k)-Routing on Plane Grids

Florian Huc, Ignasi Sau Valls, Janez Zerovnik

The packet routing problem plays an essential role in communication networks. It involves how to transfer data from some origins to some destinations within a reasonable amount of…