activity
20172026
collaborators

9 papers

math.CO2026

Results on Cartesian -capacity of graphs

Mateja Grašič, Christopher Mouron, Aljoša Šubašić +2

The concept of graph capacity extends graph span by considering the maximum number of agents that can simultaneously traverse a graph while preserving a prescribed minimum distance…

math.CO2026

Span capacities of graphs

Mateja Grašič, Christopher Mouron, Aljoša Šubašić +2

The -capacity of a graph is introduced as the maximum number of players that can simultaneously traverse such that each player visits all vertices while maintaining a di…

math.CO2023

Vertex spans of multilayered cycles

Aljoša Šubašić, Tanja Vojković

In this paper we are defining a special class of graphs called multilayered graphs and its subclass, multilayered cycles. For that subclass of graphs we are giving the values of al…

math.CO2023

Graph multicoloring in solving node malfunction and attacks in a secret-sharing network

Tanja Vojkovic, Damir Vukicevic

We observe a network scenario where parts of a secret are distributed among its nodes. Within the network, a group of attackers is actively trying to obtain the complete secret, wh…

math.CO2023

The relation between different edge spans of a graph

Aljoša Šubašić, Tanja Vojković

In several recent papers, the maximal safety distance that two players can maintain while moving through a graph has been defined and studied using three different spans of the gra…

math.CO2022

Some considerations on the maximal safety distance in a graph

Goran Erceg, Aljosa Subasic, Tanja Vojkovic

The work in this paper is motivated by I. Banič's and A. Taranenko's recent paper, where they introduced a new notion, the span of a graph. Their goal was to solve the problem of k…

math.CO2018

Safe 3-coloring of graphs

Tanja Vojkovic, Damir Vukicevic

The applications of graph coloring are diverse and many so lots of new types of coloring are being proposed and explored. Here we define a safe k-coloring, motivated by the applica…

math.CO2018

Multicoloring of Graphs to Secure a Secret

Tanja Vojković, Damir Vukičević, Vinko Zlatić

Vertex coloring and multicoloring of graphs are a well known subject in graph theory, as well as their applications. In vertex multicoloring, each vertex is assigned some subset of…

math.CO2017

Exponential Generalised Network Descriptors

Suzana Antunović, Tonći Kokan, Tanja Vojković +1

In communication networks theory the concepts of networkness and network surplus have recently been defined. Together with transmission and betweenness centrality, they were based…