149 citations · 707 across the 83 of their papers we have counts for
5 papers · 1 filter
Complexity Issues Concerning the Quadruple Roman Domination Problem in Graphs
V. S. R. Palagiri, G. P. Sharma, I. G. Yero
Given a graph with vertex set , a mapping is called a quadruple Roman dominating function (4RDF) for if it hol…
Injective colorings of Sierpiński-like graphs and Kneser graphs
Boštjan Brešar, Sandi Klavžar, Babak Samadi +1
Two relationships between the injective chromatic number and, respectively, chromatic number and chromatic index, are proved. They are applied to determine the injective chromatic…
The -distance mutual-visibility problem in graphs
M. Cera, P. Garcia-Vazquez, J. C. Valenzuela-Tripodoro +1
The concept of mutual visibility in graphs, introduced recently, addresses a fundamental problem in Graph Theory concerning the identification of the largest set of vertices in a g…
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…
Mutual-visibility problems on graphs of diameter two
Serafino Cicerone, Gabriele Di Stefano, Sandi Klavžar +1
The mutual-visibility problem in a graph asks for the cardinality of a largest set of vertices so that for any two vertices there is a shortest $x,…