7 papers · 1 filter
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…
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…
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…
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…
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…
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…