1 - 2 / 2 1 |
1. Computational complexity aspects of super domination Csilla Bujtás, Nima Ghanbari, Sandi Klavžar, 2023, izvirni znanstveni članek Ključne besede: super domination number, trees, bipartite graphs, k-subdivision of a graph, computational complexity, matching, II-matching number, II-matchings |
2. Variety of mutual-visibility problems in graphs Serafino Cicerone, Gabriele Di Stefano, Lara Drožđek, Jaka Hedžet, Sandi Klavžar, Ismael G. Yero, 2023, izvirni znanstveni članek Ključne besede: mutual-visibility, total mutual-visibility, dual mutual-visibility number, outer mutual-visibility, grid graphs, torus graphs, computational complexity |