activity
20192026
most citedRevisiting -distance (independent) domination in trees and in bipartite graphs

1 citations · 1 across the 5 of their papers we have counts for

collaborators
Showing math.COShow all

18 papers · 1 filter

math.CO2026

Improved Lower Bounds on the General Reduced Second Zagreb Index of Trees and Unicyclic Graphs

Nasrin Dehgardi, Sandi Klavžar, Mahdieh Azari

For a simple graph and a real number , the general reduced second Zagreb index is defined by the formula A sharp lowe…

math.CO2026

Wiener and Average Distance of Irregular Square-Cell Configuration

S. Prabhu, Sandi Klavžar, M. Anitha +2

A subgraph of the square lattice with all of its inner faces being 4-cycles is called a square-cell configuration. Prior work has provided explicit expressions for the total and av…

math.CO2025

On -distance -packing domination number in strong products

Csilla Bujtás, Vesna Iršič Chenoweth, Sandi Klavžar +1

The -distance -packing domination number of a graph is the cardinality of a smallest set of vertices of which is both a -distance dominating set and a $…

math.CO20251 cited

Revisiting -distance (independent) domination in trees and in bipartite graphs

Csilla Bujtás, Vesna Iršič Chenoweth, Sandi Klavžar +1

The -distance -packing domination number of is the minimum size of a set of vertices of which is both a -distance dominating set and a -packing. In 1…

math.CO2025

Moving through Cartesian products, coronas and joins in general position

Sandi Klavžar, Aditi Krishnakumar, Dorota Kuziak +3

The general position problem asks for large sets of vertices such that no three vertices of the set lie on a common shortest path. Recently a dynamic version of this problem was de…

math.CO2025

Varieties of mutual-visibility and general position on Sierpiński graphs

Dhanya Roy, Sandi Klavžar, Aparna Lakshmanan +1

The variety of mutual-visibility problems contains four members, as does the variety of general position problems. The basic problem is to determine the cardinality of the largest…