Sandi Klavzar

ORCID

Publication Activity (10 Years)

Years Active: 1987-2024
Publications (10 Years): 105

Top Venues

Discret. Appl. Math.

Appl. Math. Comput.

Discret. Math.

Discuss. Math. Graph Theory

Publications

Serafino Cicerone, Gabriele Di Stefano, Sandi Klavzar, Ismael G. Yero
Mutual-visibility problems on graphs of diameter two. Eur. J. Comb. 120 (2024)
Jing Tian, Sandi Klavzar, Elif Tan
Extremal Edge General Position Sets in Some Graphs. Graphs Comb. 40 (2) (2024)
Csilla Bujtás, Michael A. Henning, Sandi Klavzar
Partial domination in supercubic graphs. Discret. Math. 347 (1) (2024)
S. V. Ullas Chandran, Sandi Klavzar, P. K. Neethu, Rudini Menezes Sampaio
The general position avoidance game and hardness of general position games. Theor. Comput. Sci. 988 (2024)
Jing Tian, Sandi Klavzar
Graphs with total mutual-visibility number zero and total mutual-visibility in Cartesian products. Discuss. Math. Graph Theory 44 (4) (2024)
Bostjan Bresar, Sandi Klavzar, Douglas F. Rall
Packings in bipartite prisms and hypercubes. Discret. Math. 347 (4) (2024)
Serafino Cicerone, Gabriele Di Stefano, Sandi Klavzar, Ismael G. Yero
Mutual-visibility in strong products of graphs via total mutual-visibility. Discret. Appl. Math. 358 (2024)
Serafino Cicerone, Gabriele Di Stefano, Sandi Klavzar, Ismael G. Yero
Mutual-visibility problems on graphs of diameter two. CoRR (2024)
M. Arulperumjothi, Sandi Klavzar, Savari Prabhu
Redefining fractal cubic networks and determining their metric dimension and fault-tolerant metric dimension. Appl. Math. Comput. 452 (2023)
Ali Ghalavand, Sandi Klavzar, Mostafa Tavakoli, Mardjan Hakimi-Nezhaad, Freydoon Rahbarnia
Leap eccentric connectivity index in graphs with universal vertices. Appl. Math. Comput. 436 (2023)
Csilla Bujtás, Nima Ghanbari, Sandi Klavzar
Computational complexity aspects of super domination. Theor. Comput. Sci. 975 (2023)
Serafino Cicerone, Gabriele Di Stefano, Sandi Klavzar
On the mutual visibility in Cartesian products and triangle-free graphs. Appl. Math. Comput. 438 (2023)
Serafino Cicerone, Gabriele Di Stefano, Lara Drozdek, Jaka Hedzet, Sandi Klavzar, Ismael G. Yero
Variety of mutual-visibility problems in graphs. Theor. Comput. Sci. 974 (2023)
Paul D. Manuel, Bostjan Bresar, Sandi Klavzar
Geodesic packing in graphs. Appl. Math. Comput. 459 (2023)
Paul D. Manuel, Bostjan Bresar, Sandi Klavzar
The geodesic transversal problem on some networks. Comput. Appl. Math. 42 (1) (2023)
Serafino Cicerone, Gabriele Di Stefano, Lara Drozek, Jaka Hedzet, Sandi Klavzar, Ismael G. Yero
Variety of mutual-visibility problems in graphs. CoRR (2023)
Sarah E. Anderson, Bostjan Bresar, Sandi Klavzar, Kirsti Kuenzel, Douglas F. Rall
Orientable domination in product-like graphs. Discret. Appl. Math. 326 (2023)
Sandi Klavzar, Hui Lei, Xiaopan Lian, Yongtang Shi
A characterization of 4-χS-vertex-critical graphs for packing sequences with s1=1 and s2≥3. Discret. Appl. Math. 338 (2023)
Kexiang Xu, Jing Tian, Sandi Klavzar
New transmission irregular chemical graphs. Discret. Appl. Math. 340 (2023)
S. V. Ullas Chandran, Sandi Klavzar, P. K. Neethu, Rudini Sampaio
The general position avoidance game and hardness of general position games. CoRR (2022)
Savari Prabhu, V. Manimozhi, M. Arulperumjothi, Sandi Klavzar
Twin vertices in fault-tolerant metric sets and fault-tolerant metric dimension of multistage interconnection networks. Appl. Math. Comput. 420 (2022)
Csilla Bujtás, Vesna Irsic, Sandi Klavzar
1/2-conjectures on the domination game and claw-free graphs. Eur. J. Comb. 101 (2022)
Paul D. Manuel, Bostjan Bresar, Sandi Klavzar
Geodesic packing in graphs. CoRR (2022)
Csilla Bujtás, Vesna Irsic, Sandi Klavzar
Predominating a Vertex in the Connected Domination Game. Graphs Comb. 38 (3) (2022)
Sandi Klavzar, P. K. Neethu, S. V. Ullas Chandran
The general position achievement game played on graphs. Discret. Appl. Math. 317 (2022)
Hongbo Hua, Xinying Hua, Sandi Klavzar, Kexiang Xu
Relating the total domination number and the annihilation number for quasi-trees and some composite graphs. Discret. Math. 345 (9) (2022)
Saieed Akbari, Arash Beikmohammadi, Sandi Klavzar, Nazanin Movarraei
On the chromatic vertex stability number of graphs. Eur. J. Comb. 102 (2022)
Paul D. Manuel, Sandi Klavzar, R. Prabha, Andrew Arokiaraj
The geodesic cover problem for butterfly networks. CoRR (2022)
Paul D. Manuel, Bostjan Bresar, Sandi Klavzar
The geodesic-transversal problem. Appl. Math. Comput. 413 (2022)
Kexiang Xu, Sandi Klavzar
Constructing new families of transmission irregular graphs. Discret. Appl. Math. 289 (2021)
Sandi Klavzar, Dorota Kuziak, Iztok Peterin, Ismael G. Yero
A Steiner general position problem in graph theory. Comput. Appl. Math. 40 (6) (2021)
Sandi Klavzar, Mostafa Tavakoli
Edge metric dimensions via hierarchical product and integer linear programming. Optim. Lett. 15 (6) (2021)
Sandi Klavzar, Gregor Rus
The general position number of integer lattices. Appl. Math. Comput. 390 (2021)
Janja Jerebic, Sandi Klavzar, Gregor Rus
On ℓ-Distance-Balanced Product Graphs. Graphs Comb. 37 (1) (2021)
Xingfu Li, Guihai Yu, Sandi Klavzar, Jie Hu, Bo Li
-eccentricity on trees. Theor. Comput. Sci. 889 (2021)
Sandi Klavzar, Mostafa Tavakoli
Dominated and dominator colorings over (edge) corona and hierarchical products. Appl. Math. Comput. 390 (2021)
Jane Olive Sharon, T. M. Rajalaxmi, Sandi Klavzar, R. Sundara Rajan, Indra Rajasingh
Transmission in H-naphtalenic nanosheet. Appl. Math. Comput. 406 (2021)
P. K. Neethu, S. V. Ullas Chandran, Manoj Changat, Sandi Klavzar
On the General Position Number of Complementary Prisms. Fundam. Informaticae 178 (3) (2021)
Hamid Darabi, Yaser Alizadeh, Sandi Klavzar, Kinkar Chandra Das
On the relation between Wiener index and eccentricity of a graph. J. Comb. Optim. 41 (4) (2021)
Xingfu Li, Guihai Yu, Aleksandar Ilic, Sandi Klavzar
On the computational complexity of the Steiner k-eccentricity. CoRR (2021)
Sandi Klavzar, Douglas F. Rall, Ismael G. Yero
General d-position sets. Ars Math. Contemp. 21 (1) (2021)
Sandi Klavzar, Freydoon Rahbarnia, Mostafa Tavakoli
Some binary products and integer linear programming for k-metric dimension of graphs. Appl. Math. Comput. 409 (2021)
Xingfu Li, Guihai Yu, Sandi Klavzar
On the average Steiner 3-eccentricity of trees. Discret. Appl. Math. 304 (2021)
R. Sundara Rajan, Thomas Kalinowski, Sandi Klavzar, Hamid Mokhtar, T. M. Rajalaxmi
Lower bounds for dilation, wirelength, and edge congestion of embedding graphs into hypercubes. J. Supercomput. 77 (4) (2021)
Modjtaba Ghorbani, Sandi Klavzar, Hamid Reza Maimani, Mostafa Momeni, F. Rahimi Mahid, Gregor Rus
The general position problem on Kneser graphs and on some graph operations. Discuss. Math. Graph Theory 41 (4) (2021)
Anja Kisek, Sandi Klavzar
Correcting the algorithm for the secure domination number of cographs by Jha, Pradhan, and Banerjee. Inf. Process. Lett. 172 (2021)
Kexiang Xu, Aleksandar Ilic, Vesna Irsic, Sandi Klavzar, Huimin Li
Comparing Wiener complexity with eccentric complexity. Discret. Appl. Math. 290 (2021)
A. Arul Shantrinal, Sandi Klavzar, T. M. Rajalaxmi, R. Sundara Rajan
An algorithm for embedding Turán graphs into incomplete hypercubes with minimum wirelength. J. Graph Algorithms Appl. 25 (1) (2021)
Bostjan Bresar, Csilla Bujtás, Tanja Gologranc, Sandi Klavzar, Gasper Kosmrlj, Tilen Marc, Balázs Patkós, Zsolt Tuza, Máté Vizer
On Grundy total domination number in product graphs. Discuss. Math. Graph Theory 41 (1) (2021)
Saeid Alikhani, Sandi Klavzar, Florian Lehner, Samaneh Soltani
Trees with distinguishing index equal distinguishing number plus one. Discuss. Math. Graph Theory 40 (3) (2020)
Andrew Arokiaraj, Sandi Klavzar, Paul D. Manuel, Elizabeth Thomas, Antony Xavier
Strong geodetic problems in networks. Discuss. Math. Graph Theory 40 (1) (2020)
Bostjan Bresar, Jasmina Ferme, Sandi Klavzar, Douglas F. Rall
A survey on packing colorings. Discuss. Math. Graph Theory 40 (4) (2020)
Sandi Klavzar, Indra Rajasingh, D. Ahima Emilet
-lucky number. Appl. Math. Comput. 366 (2020)
Premysl Holub, Marko Jakovac, Sandi Klavzar
S-packing chromatic vertex-critical graphs. Discret. Appl. Math. 285 (2020)
Valentin Gledel, Michael A. Henning, Vesna Irsic, Sandi Klavzar
Maker-Breaker total domination game. Discret. Appl. Math. 282 (2020)
Bostjan Bresar, Sandi Klavzar, Nazanin Movarraei
Critical graphs for the chromatic edge-stability number. Discret. Math. 343 (6) (2020)
Sandi Klavzar, Mostafa Tavakoli
Local metric dimension of graphs: Generalized hierarchical products and some applications. Appl. Math. Comput. 364 (2020)
Jun Yue, Shizhen Zhang, Yiping Zhu, Sandi Klavzar, Yongtang Shi
The annihilation number does not bound the 2-domination number from the above. Discret. Math. 343 (6) (2020)
Saieed Akbari, Sandi Klavzar, Nazanin Movarraei, Mina Nahvi
Nordhaus-Gaddum and other bounds for the chromatic edge-stability number. Eur. J. Comb. 84 (2020)
Csilla Bujtás, Vesna Irsic, Sandi Klavzar
Z-domination game. Discret. Math. 343 (11) (2020)
Bijo S. Anand, S. V. Ullas Chandran, Manoj Changat, Sandi Klavzar, Elias John Thomas
Characterization of general position sets and its applications to cographs and bipartite graphs. Appl. Math. Comput. 359 (2019)
Valentin Gledel, Vesna Irsic, Sandi Klavzar
Strong geodetic cores and Cartesian product graphs. Appl. Math. Comput. 363 (2019)
Bostjan Bresar, Nicolas Gastineau, Sandi Klavzar, Olivier Togni
Exact Distance Graphs of Product Graphs. Graphs Comb. 35 (6) (2019)
Sandi Klavzar, Kolja Knauer, Tilen Marc
On the Djoković-Winkler relation and its closure in subdivisions of fullerenes, triangulations, and chordal graphs. CoRR (2019)
Emeric Deutsch, Sandi Klavzar
M-polynomial revisited: Bethe cacti and an extension of Gutman's approach. J. Appl. Math. Comput. 60 (1-2) (2019)
Sandi Klavzar, Douglas F. Rall
Packing chromatic vertex-critical graphs. Discret. Math. Theor. Comput. Sci. 21 (3) (2019)
Yaser Alizadeh, Ehsan Estaji, Sandi Klavzar, Marko Petkovsek
Metric properties of generalized Sierpiński graphs over stars. Discret. Appl. Math. 266 (2019)
Sandi Klavzar, Douglas F. Rall
Domination game and minimal edge cuts. Discret. Math. 342 (4) (2019)
Thierry Bousch, Andreas M. Hinz, Sandi Klavzar, Daniele Parisse, Ciril Petr, Paul K. Stockmeyer
A note on the Frame-Stewart conjecture. Discret. Math. Algorithms Appl. 11 (4) (2019)
Paul Dorbec, Michael A. Henning, Sandi Klavzar, Gasper Kosmrlj
Cutting lemma and union lemma for the domination game. Discret. Math. 342 (4) (2019)
Valentin Gledel, Vesna Irsic, Sandi Klavzar
Fast Winning Strategies for the Maker-Breaker Domination Game. LAGOS (2019)
Sandi Klavzar, Michel Mollard
Daisy cubes and distance cube polynomial. Eur. J. Comb. 80 (2019)
Mostafa Tavakoli, Sandi Klavzar
-alliances over some graph products. Central Eur. J. Oper. Res. 27 (3) (2019)
Michael A. Henning, Sandi Klavzar, Douglas F. Rall
Game total domination critical graphs. Discret. Appl. Math. 250 (2018)
Vesna Irsic, Sandi Klavzar
Strong geodetic problem on Cartesian products of graphs. RAIRO Oper. Res. 52 (1) (2018)
Jernej Azarija, Sandi Klavzar, Yoomi Rho, Seungbo Sim
On domination-type invariants of Fibonacci cubes and hypercubes. Ars Math. Contemp. 14 (2) (2018)
Sandi Klavzar, Shuchao Li, Huihui Zhang
On the difference between the (revised) Szeged index and the Wiener index of cacti. Discret. Appl. Math. 247 (2018)
R. Sundara Rajan, Thomas Kalinowski, Sandi Klavzar, Hamid Mokhtar, T. M. Rajalaxmi
Lower bounds for dilation, wirelength, and edge congestion of embedding graphs into hypercubes. CoRR (2018)
Kexiang Xu, Haiqiong Liu, Kinkar Chandra Das, Sandi Klavzar
Embeddings into almost self-centered graphs of given radius. J. Comb. Optim. 36 (4) (2018)
Sandi Klavzar, D. Azubha Jemilet, Indra Rajasingh, Paul D. Manuel, N. Parthiban
General Transmission Lemma and Wiener complexity of triangular grids. Appl. Math. Comput. 338 (2018)
Paul D. Manuel, Sandi Klavzar
The Graph Theory General Position Problem on Some Interconnection Networks. Fundam. Informaticae 163 (4) (2018)
Kexiang Xu, Xia Li, Sandi Klavzar
On graphs with largest possible game domination number. Discret. Math. 341 (6) (2018)
Bostjan Bresar, Sandi Klavzar
Professor Wilfried Imrich awarded honorary doctorate at the University of Maribor. Art Discret. Appl. Math. 1 (1) (2018)
Yaser Alizadeh, Sandi Klavzar
On graphs whose Wiener complexity equals their order and on Wiener index of asymmetric graphs. Appl. Math. Comput. 328 (2018)
Bostjan Bresar, Paul Dorbec, Sandi Klavzar, Gasper Kosmrlj
How long can one bluff in the domination game?. Discuss. Math. Graph Theory 37 (2) (2017)
Saeid Alikhani, Davood Fatehi, Sandi Klavzar
On the Structure of Dominating Graphs. Graphs Comb. 33 (4) (2017)
Andreas M. Hinz, Sandi Klavzar, Sara Sabrina Zemljic
A survey and classification of Sierpiński-type graphs. Discret. Appl. Math. 217 (2017)
Bostjan Bresar, Csilla Bujtás, Tanja Gologranc, Sandi Klavzar, Gasper Kosmrlj, Balázs Patkós, Zsolt Tuza, Máté Vizer
Grundy dominating sequences and zero forcing sets. Discret. Optim. 26 (2017)
Jernej Azarija, Michael A. Henning, Sandi Klavzar
(Total) Domination in Prisms. Electron. J. Comb. 24 (1) (2017)
Sandi Klavzar, Iztok Peterin, Ismael González Yero
Graphs that are simultaneously efficient open domination and efficient closed domination graphs. Discret. Appl. Math. 217 (2017)
Bostjan Bresar, Sandi Klavzar, Douglas F. Rall, Kirsti Wash
Packing chromatic number under local changes in a graph. Discret. Math. 340 (5) (2017)
Michael A. Henning, Sandi Klavzar, Douglas F. Rall
The 4/5 upper bound on the game total domination number. Comb. 37 (2) (2017)
Zehui Shao, Sandi Klavzar, Zepeng Li, Pu Wu, Jin Xu
On the signed Roman k-domination: Complexity and thin torus graphs. Discret. Appl. Math. 233 (2017)
Sandi Klavzar
Wilfried Imrich's 75th Birthday Colloquium. Ars Math. Contemp. 11 (2) (2016)
Wilfried Imrich, Ali Iranmanesh, Sandi Klavzar, Abolghasem Soltani
Edge-transitive lexicographic and Cartesian products. Discuss. Math. Graph Theory 36 (4) (2016)
Jernej Azarija, Sandi Klavzar, Jaehun Lee, Jay Pantone, Yoomi Rho
On isomorphism classes of generalized Fibonacci cubes. Eur. J. Comb. 51 (2016)
Sandi Klavzar, Paul D. Manuel, Mohammad J. Nadjafi-Arani, R. Sundara Rajan, Cyriac Grigorious, Sudeep Stephen
Average Distance in Interconnection Networks via Reduction Theorems for Vertex-Weighted Graphs. Comput. J. 59 (12) (2016)
Bostjan Bresar, Paul Dorbec, Sandi Klavzar, Gasper Kosmrlj, Gabriel Renault
Complexity of the game domination problem. Theor. Comput. Sci. 648 (2016)
Sandi Klavzar
Bojan Mohar's 60th Birthday. Ars Math. Contemp. 11 (2) (2016)
Ali Reza Ashrafi, Jernej Azarija, Azam Babai, Khadijeh Fathalikhani, Sandi Klavzar
The (non-)existence of perfect codes in Fibonacci cubes. Inf. Process. Lett. 116 (5) (2016)

Sandi Klavzar.css-eqlu8i{font-size:small;padding-left:4px;}

Publication Activity (10 Years)

Top Topics

Top Venues

Sandi Klavzar