4 citations · 7 across the 16 of their papers we have counts for
Showing 2021Show all
3 papers · 1 filter
math.CO2021
Roman domination in direct product graphs and rooted product graphs
Abel Cabrera Martinez, Iztok Peterin, Ismael G. Yero
Let be a graph with vertex set . A function is a Roman dominating function on if every vertex for which is adjacent…
math.CO2021
A Steiner general position problem in graph theory
Sandi Klavžar, Dorota Kuziak, Iztok Peterin +1
Let be a graph. The Steiner distance of is the minimum size of a connected subgraph of containing . Such a subgraph is necessarily a tree called a Stei…
math.CO2021
The Simultaneous Fractional Dimension of Graph Families
Cong X. Kang, Iztok Peterin, Eunjeong Yi
A subset of the vertices of a connected graph resolves if no two vertices of share the same list of distances (shortest-path metric) with respect to the vertice…