R. Škrekovski

activity

20062026

most citedReplication in critical graphs and the persistence of monomial ideals

48 citations · 253 across the 49 of their papers we have counts for

collaborators

Showing 2024Show all

3 papers · 1 filter

math.CO2024

Extremizing antiregular graphs by modifying total $σ$ -irregularity

Martin Knor, Riste Škrekovski, Slobodan Filipovski +1

The total $σ$ -irregularity is given by $σ_{t} (G) = \sum_{{u, v} \subseteq V (G)} (d_{G} (u) - d_{G} (v))^{2},$ where $d_{G} (z)$ indicates the degree of a vertex $z$ within the gra…

math.CO2024

On strong odd colorings of graphs

Yair Caro, Mirko Petruševski, Riste Škrekovski +1

A strong odd coloring of a simple graph $G$ is a proper coloring of the vertices of $G$ such that for every vertex $v$ and every color $c$ , either $c$ is used an odd number of time…

math.CO2024

Domination number of modular product graphs

Sergio Bermudo, Iztok Peterin, Jelena Sedlar +1

The modular product $G ⋄ H$ of graphs $G$ and $H$ is a graph on vertex set $V (G) \times V (H)$ . Two vertices $(g, h)$ and $(g^{'}, h^{'})$ of $G ⋄ H$ are adjacent…

Extremizing antiregular graphs by modifying total σ-irregularity

On strong odd colorings of graphs

Domination number of modular product graphs

Extremizing antiregular graphs by modifying total $σ$ -irregularity