activity
20202025
most cited-packing chromatic vertex-critical graphs

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

collaborators

9 papers

math.CO2025

Packing chromatic number of unitary Cayley graphs of and algorithmic approaches to it

Zahra Hamed-Labbafian, Mostafa Tavakoli, Mojgan Afkhami +1

A packing -coloring of a graph is a partition of into disjoint non-empty classes , such that if , , , then the dis…

math.CO2024

Weighted Padovan graphs

Vesna Iršič Chenoweth, Sandi Klavžar, Gregor Rus +1

Weighted Padovan graphs , , , are introduced as the graphs whose vertices are all Padov…

math.CO2024

Coloring the vertices of a graph with mutual-visibility property

Sandi Klavžar, Dorota Kuziak, Juan Carlos Valenzuela Tripodoro +1

Given a graph , a mutual-visibility coloring of is introduced as follows. We color two vertices with a same color, if there is a shortest -path whose inte…

math.CO2024

Maker-Breaker domination game critical graphs

Athira Divakaran, Tanja Dravec, Tijo James +2

The Maker-Breaker domination game (MBD game) is a two-player game played on a graph by Dominator and Staller. They alternately select unplayed vertices of . The goal of Domi…

math.CO2024★ 1 cited

Maker-Breaker resolving game played on corona products of graphs

Tijo James, Sandi Klavžar, Dorota Kuziak +2

The Maker-Breaker resolving game is a game played on a graph by Resolver and Spoiler. The players taking turns alternately in which each player selects a not yet played vertex…

math.CO2024★ 1 cited

Maker-Breaker domination game played on corona products of graphs

Athira Divakaran, Tijo James, Sandi Klavžar +1

In the Maker-Breaker domination game, Dominator and Staller play on a graph by taking turns in which each player selects a not yet played vertex of . Dominator's goal is to…

math.CO2023

Generalized Pell graphs

Vesna Iršič, Sandi Klavžar, Elif Tan

In this paper, generalized Pell graphs , , are introduced. The special case of are the Pell graphs defined earlier by Munarini. Several metric, enume…

math.CO2023

Generalized stepwise transmission irregular graphs

Yaser Alizadeh, Sandi Klavžar, Zohre Molaee

The transmission of a vertex of a connected graph is the sum of distances from to all other vertices. is a stepwise transmission irregular (STI) gra…

math.CO2020★ 2 cited

-packing chromatic vertex-critical graphs

Přemysl Holub, Marko Jakovac, Sandi Klavžar

For a non-decreasing sequence of positive integers , the {\em -packing chromatic number} of is the smallest integer such that the vertex s…