default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDSandi Klavzar
Sandi Klavžar
Person information
- unicode name: Sandi Klavžar
- affiliation: University of Ljubljana, Faculty of Mathematics and Physics
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2025
[j269]Dhanya Roy, Sandi Klavzar
, S. Aparna Lakshmanan:
Mutual-visibility and general position in double graphs and in Mycielskians. Appl. Math. Comput. 488: 129131 (2025)- 2024
- [j268]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: 136-146 (2024) - [j267]Csilla Bujtás, Michael A. Henning, Sandi Klavzar:
Partial domination in supercubic graphs. Discret. Math. 347(1): 113669 (2024) - [j266]Bostjan Bresar, Sandi Klavzar, Douglas F. Rall:
Packings in bipartite prisms and hypercubes. Discret. Math. 347(4): 113875 (2024) - [j265]Jing Tian, Sandi Klavzar:
Graphs with total mutual-visibility number zero and total mutual-visibility in Cartesian products. Discuss. Math. Graph Theory 44(4): 1277-1291 (2024) - [j264]Serafino Cicerone, Gabriele Di Stefano, Sandi Klavzar, Ismael G. Yero:
Mutual-visibility problems on graphs of diameter two. Eur. J. Comb. 120: 103995 (2024) - [j263]Jing Tian, Sandi Klavzar, Elif Tan:
Extremal Edge General Position Sets in Some Graphs. Graphs Comb. 40(2): 40 (2024) - [j262]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: 114370 (2024) - [i10]Serafino Cicerone, Gabriele Di Stefano, Sandi Klavzar, Ismael G. Yero:
Mutual-visibility problems on graphs of diameter two. CoRR abs/2401.02373 (2024) - 2023
- [b2]Ömer Egecioglu, Sandi Klavzar, Michel Mollard:
Fibonacci Cubes with Applications and Variations. WorldScientific 2023, ISBN 9789811269035, pp. 1-304 - [j261]Ali Ghalavand, Sandi Klavzar, Mostafa Tavakoli, Mardjan Hakimi-Nezhaad, Freydoon Rahbarnia:
Leap eccentric connectivity index in graphs with universal vertices. Appl. Math. Comput. 436: 127519 (2023) - [j260]Serafino Cicerone, Gabriele Di Stefano, Sandi Klavzar:
On the mutual visibility in Cartesian products and triangle-free graphs. Appl. Math. Comput. 438: 127619 (2023) - [j259]M. Arulperumjothi, Sandi Klavzar, Savari Prabhu:
Redefining fractal cubic networks and determining their metric dimension and fault-tolerant metric dimension. Appl. Math. Comput. 452: 128037 (2023) - [j258]Paul D. Manuel, Bostjan Bresar, Sandi Klavzar:
Geodesic packing in graphs. Appl. Math. Comput. 459: 128277 (2023) - [j257]Paul D. Manuel, Bostjan Bresar, Sandi Klavzar:
The geodesic transversal problem on some networks. Comput. Appl. Math. 42(1) (2023) - [j256]Sarah E. Anderson, Bostjan Bresar, Sandi Klavzar, Kirsti Kuenzel, Douglas F. Rall:
Orientable domination in product-like graphs. Discret. Appl. Math. 326: 62-69 (2023) - [j255]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: 46-55 (2023) - [j254]Kexiang Xu, Jing Tian, Sandi Klavzar:
New transmission irregular chemical graphs. Discret. Appl. Math. 340: 286-295 (2023) - [j253]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: 114096 (2023) - [j252]Csilla Bujtás, Nima Ghanbari, Sandi Klavzar:
Computational complexity aspects of super domination. Theor. Comput. Sci. 975: 114137 (2023) - [i9]Serafino Cicerone, Gabriele Di Stefano, Lara Drozdek, Jaka Hedzet, Sandi Klavzar, Ismael G. Yero:
Variety of mutual-visibility problems in graphs. CoRR abs/2304.00864 (2023) - 2022
- [j251]Paul D. Manuel, Bostjan Bresar, Sandi Klavzar:
The geodesic-transversal problem. Appl. Math. Comput. 413: 126621 (2022) - [j250]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: 126897 (2022) - [j249]Sandi Klavzar, P. K. Neethu, S. V. Ullas Chandran:
The general position achievement game played on graphs. Discret. Appl. Math. 317: 109-116 (2022) - [j248]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): 112965 (2022) - [j247]Csilla Bujtás, Vesna Irsic, Sandi Klavzar:
1/2-conjectures on the domination game and claw-free graphs. Eur. J. Comb. 101: 103467 (2022) - [j246]Saieed Akbari, Arash Beikmohammadi, Sandi Klavzar, Nazanin Movarraei:
On the chromatic vertex stability number of graphs. Eur. J. Comb. 102: 103504 (2022) - [j245]Csilla Bujtás, Vesna Irsic, Sandi Klavzar:
Predominating a Vertex in the Connected Domination Game. Graphs Comb. 38(3): 77 (2022) - [i8]S. V. Ullas Chandran, Sandi Klavzar, P. K. Neethu, Rudini Menezes Sampaio:
The general position avoidance game and hardness of general position games. CoRR abs/2205.03526 (2022) - [i7]Paul D. Manuel, Sandi Klavzar, R. Prabha, Andrew Arokiaraj:
The geodesic cover problem for butterfly networks. CoRR abs/2210.12675 (2022) - [i6]Paul D. Manuel, Bostjan Bresar, Sandi Klavzar:
Geodesic packing in graphs. CoRR abs/2210.15325 (2022) - 2021
- [j244]Sandi Klavzar, Mostafa Tavakoli:
Dominated and dominator colorings over (edge) corona and hierarchical products. Appl. Math. Comput. 390: 125647 (2021) - [j243]Sandi Klavzar, Gregor Rus:
The general position number of integer lattices. Appl. Math. Comput. 390: 125664 (2021) - [j242]Jane Olive Sharon, T. M. Rajalaxmi, Sandi Klavzar, R. Sundara Rajan, Indra Rajasingh:
Transmission in H-naphtalenic nanosheet. Appl. Math. Comput. 406: 126285 (2021) - [j241]Sandi Klavzar, Freydoon Rahbarnia, Mostafa Tavakoli:
Some binary products and integer linear programming for k-metric dimension of graphs. Appl. Math. Comput. 409: 126420 (2021) - [j240]Sandi Klavzar, Douglas F. Rall, Ismael G. Yero:
General d-position sets. Ars Math. Contemp. 21(1) (2021) - [j239]Sandi Klavzar, Dorota Kuziak, Iztok Peterin, Ismael G. Yero:
A Steiner general position problem in graph theory. Comput. Appl. Math. 40(6) (2021) - [j238]Kexiang Xu, Sandi Klavzar:
Constructing new families of transmission irregular graphs. Discret. Appl. Math. 289: 383-391 (2021) - [j237]Kexiang Xu, Aleksandar Ilic, Vesna Irsic, Sandi Klavzar, Huimin Li:
Comparing Wiener complexity with eccentric complexity. Discret. Appl. Math. 290: 7-16 (2021) - [j236]Xingfu Li, Guihai Yu, Sandi Klavzar:
On the average Steiner 3-eccentricity of trees. Discret. Appl. Math. 304: 181-195 (2021) - [j235]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): 225-247 (2021) - [j234]Modjtaba Ghorbani, Sandi Klavzar, Hamid Reza Maimani, Mostafa Momeni, Farhad Rahimi Mahid, Gregor Rus:
The general position problem on Kneser graphs and on some graph operations. Discuss. Math. Graph Theory 41(4): 1199-1213 (2021) - [j233]P. K. Neethu, S. V. Ullas Chandran, Manoj Changat, Sandi Klavzar:
On the General Position Number of Complementary Prisms. Fundam. Informaticae 178(3): 267-281 (2021) - [j232]Janja Jerebic, Sandi Klavzar, Gregor Rus:
On ℓ-Distance-Balanced Product Graphs. Graphs Comb. 37(1): 369-379 (2021) - [j231]Anja Kisek, Sandi Klavzar:
Correcting the algorithm for the secure domination number of cographs by Jha, Pradhan, and Banerjee. Inf. Process. Lett. 172: 106155 (2021) - [j230]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): 817-829 (2021) - [j229]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): 367-381 (2021) - [j228]Sandi Klavzar, Mostafa Tavakoli:
Edge metric dimensions via hierarchical product and integer linear programming. Optim. Lett. 15(6): 1993-2003 (2021) - [j227]Xingfu Li, Guihai Yu, Sandi Klavzar, Jie Hu, Bo Li:
The Steiner k-eccentricity on trees. Theor. Comput. Sci. 889: 182-188 (2021) - [j226]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): 4135-4150 (2021) - [i5]Xingfu Li, Guihai Yu, Aleksandar Ilic, Sandi Klavzar:
On the computational complexity of the Steiner k-eccentricity. CoRR abs/2112.01140 (2021) - 2020
- [j225]Sandi Klavzar, Mostafa Tavakoli:
Local metric dimension of graphs: Generalized hierarchical products and some applications. Appl. Math. Comput. 364 (2020) - [j224]Sandi Klavzar, Indra Rajasingh, D. Ahima Emilet:
A lower bound and several exact results on the d-lucky number. Appl. Math. Comput. 366 (2020) - [j223]Valentin Gledel, Michael A. Henning, Vesna Irsic, Sandi Klavzar:
Maker-Breaker total domination game. Discret. Appl. Math. 282: 96-107 (2020) - [j222]Premysl Holub, Marko Jakovac, Sandi Klavzar:
S-packing chromatic vertex-critical graphs. Discret. Appl. Math. 285: 119-127 (2020) - [j221]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): 111707 (2020) - [j220]Bostjan Bresar, Sandi Klavzar, Nazanin Movarraei:
Critical graphs for the chromatic edge-stability number. Discret. Math. 343(6): 111845 (2020) - [j219]Csilla Bujtás, Vesna Irsic, Sandi Klavzar:
Z-domination game. Discret. Math. 343(11): 112076 (2020) - [j218]Andrew Arokiaraj, Sandi Klavzar, Paul D. Manuel, Elizabeth Thomas, Antony Xavier:
Strong geodetic problems in networks. Discuss. Math. Graph Theory 40(1): 307-321 (2020) - [j217]Saeid Alikhani, Sandi Klavzar, Florian Lehner, Samaneh Soltani:
Trees with distinguishing index equal distinguishing number plus one. Discuss. Math. Graph Theory 40(3): 875-884 (2020) - [j216]Bostjan Bresar, Jasmina Ferme, Sandi Klavzar, Douglas F. Rall:
A survey on packing colorings. Discuss. Math. Graph Theory 40(4): 923-970 (2020) - [j215]Saieed Akbari, Sandi Klavzar, Nazanin Movarraei, Mina Nahvi:
Nordhaus-Gaddum and other bounds for the chromatic edge-stability number. Eur. J. Comb. 84 (2020)
2010 – 2019
- 2019
- [j214]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: 84-89 (2019) - [j213]Valentin Gledel, Vesna Irsic, Sandi Klavzar:
Strong geodetic cores and Cartesian product graphs. Appl. Math. Comput. 363 (2019) - [j212]Mostafa Tavakoli, Sandi Klavzar:
Distribution of global defensive k-alliances over some graph products. Central Eur. J. Oper. Res. 27(3): 615-623 (2019) - [j211]Yaser Alizadeh, Ehsan Estaji, Sandi Klavzar, Marko Petkovsek:
Metric properties of generalized Sierpiński graphs over stars. Discret. Appl. Math. 266: 48-55 (2019) - [j210]Sandi Klavzar, Douglas F. Rall:
Domination game and minimal edge cuts. Discret. Math. 342(4): 951-958 (2019) - [j209]Paul Dorbec, Michael A. Henning, Sandi Klavzar, Gasper Kosmrlj:
Cutting lemma and union lemma for the domination game. Discret. Math. 342(4): 1213-1222 (2019) - [j208]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): 1950049:1-1950049:4 (2019) - [j207]Sandi Klavzar, Douglas F. Rall:
Packing chromatic vertex-critical graphs. Discret. Math. Theor. Comput. Sci. 21(3) (2019) - [j206]Sandi Klavzar, Michel Mollard:
Daisy cubes and distance cube polynomial. Eur. J. Comb. 80: 214-223 (2019) - [j205]Bostjan Bresar, Nicolas Gastineau, Sandi Klavzar, Olivier Togni:
Exact Distance Graphs of Product Graphs. Graphs Comb. 35(6): 1555-1569 (2019) - [j204]Emeric Deutsch, Sandi Klavzar:
M-polynomial revisited: Bethe cacti and an extension of Gutman's approach. J. Appl. Math. Comput. 60(1-2): 253-264 (2019) - [c3]Valentin Gledel, Vesna Irsic, Sandi Klavzar:
Fast Winning Strategies for the Maker-Breaker Domination Game. LAGOS 2019: 473-484 - [i4]Sandi Klavzar, Kolja Knauer, Tilen Marc:
On the Djoković-Winkler relation and its closure in subdivisions of fullerenes, triangulations, and chordal graphs. CoRR abs/1906.06111 (2019) - 2018
- [j203]Bostjan Bresar, Sandi Klavzar:
Professor Wilfried Imrich awarded honorary doctorate at the University of Maribor. Art Discret. Appl. Math. 1(1): #N1.02 (2018) - [j202]Yaser Alizadeh, Sandi Klavzar:
On graphs whose Wiener complexity equals their order and on Wiener index of asymmetric graphs. Appl. Math. Comput. 328: 113-118 (2018) - [j201]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: 115-122 (2018) - [j200]Jernej Azarija, Sandi Klavzar, Yoomi Rho, Seungbo Sim:
On domination-type invariants of Fibonacci cubes and hypercubes. Ars Math. Contemp. 14(2): 387-395 (2018) - [j199]Sandi Klavzar, Shuchao Li, Huihui Zhang:
On the difference between the (revised) Szeged index and the Wiener index of cacti. Discret. Appl. Math. 247: 77-89 (2018) - [j198]Michael A. Henning, Sandi Klavzar, Douglas F. Rall:
Game total domination critical graphs. Discret. Appl. Math. 250: 28-37 (2018) - [j197]Kexiang Xu, Xia Li, Sandi Klavzar:
On graphs with largest possible game domination number. Discret. Math. 341(6): 1768-1777 (2018) - [j196]Paul D. Manuel, Sandi Klavzar:
The Graph Theory General Position Problem on Some Interconnection Networks. Fundam. Informaticae 163(4): 339-350 (2018) - [j195]Kexiang Xu, Haiqiong Liu, Kinkar Chandra Das, Sandi Klavzar:
Embeddings into almost self-centered graphs of given radius. J. Comb. Optim. 36(4): 1388-1410 (2018) - [j194]Vesna Irsic, Sandi Klavzar:
Strong geodetic problem on Cartesian products of graphs. RAIRO Oper. Res. 52(1): 205-216 (2018) - [i3]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 abs/1807.06787 (2018) - 2017
- [j193]Michael A. Henning, Sandi Klavzar, Douglas F. Rall:
The 4/5 upper bound on the game total domination number. Comb. 37(2): 223-251 (2017) - [j192]Jernej Azarija, Michael A. Henning, Sandi Klavzar:
(Total) Domination in Prisms. Electron. J. Comb. 24(1): 1 (2017) - [j191]Andreas M. Hinz, Sandi Klavzar, Sara Sabrina Zemljic:
A survey and classification of Sierpiński-type graphs. Discret. Appl. Math. 217: 565-600 (2017) - [j190]Sandi Klavzar, Iztok Peterin, Ismael González Yero:
Graphs that are simultaneously efficient open domination and efficient closed domination graphs. Discret. Appl. Math. 217: 613-621 (2017) - [j189]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: 175-186 (2017) - [j188]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: 66-77 (2017) - [j187]Bostjan Bresar, Sandi Klavzar, Douglas F. Rall, Kirsti Wash:
Packing chromatic number under local changes in a graph. Discret. Math. 340(5): 1110-1115 (2017) - [j186]Bostjan Bresar, Paul Dorbec, Sandi Klavzar, Gasper Kosmrlj:
How long can one bluff in the domination game?. Discuss. Math. Graph Theory 37(2): 337-352 (2017) - [j185]Saeid Alikhani, Davood Fatehi, Sandi Klavzar:
On the Structure of Dominating Graphs. Graphs Comb. 33(4): 665-672 (2017) - 2016
- [j184]Modjtaba Ghorbani, Sandi Klavzar:
Modified Wiener index via canonical metric representation, and some fullerene patches. Ars Math. Contemp. 11(2): 247-254 (2016) - [j183]Sandi Klavzar:
Wilfried Imrich's 75th Birthday Colloquium. Ars Math. Contemp. 11(2) (2016) - [j182]Sandi Klavzar:
Bojan Mohar's 60th Birthday. Ars Math. Contemp. 11(2) (2016) - [j181]Zhendong Shao, Igor Averbakh, Sandi Klavzar:
Labeling Dot-Cartesian and Dot-Lexicographic Product Graphs with a Condition at Distance Two. Comput. J. 59(1): 151-158 (2016) - [j180]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): 1900-1910 (2016) - [j179]Bostjan Bresar, Csilla Bujtás, Tanja Gologranc, Sandi Klavzar, Gasper Kosmrlj, Balázs Patkós, Zsolt Tuza, Máté Vizer:
Dominating Sequences in Grid-Like and Toroidal Graphs. Electron. J. Comb. 23(4): 4 (2016) - [j178]Wilfried Imrich, Ali Iranmanesh, Sandi Klavzar, Abolghasem Soltani:
Edge-transitive lexicographic and Cartesian products. Discuss. Math. Graph Theory 36(4): 857-865 (2016) - [j177]Jernej Azarija, Sandi Klavzar, Jaehun Lee, Jay Pantone, Yoomi Rho:
On isomorphism classes of generalized Fibonacci cubes. Eur. J. Comb. 51: 372-379 (2016) - [j176]Csilla Bujtás, Sandi Klavzar:
Improved Upper Bounds on the Domination Number of Graphs With Minimum Degree at Least Five. Graphs Comb. 32(2): 511-519 (2016) - [j175]Bostjan Bresar, Sandi Klavzar, Douglas F. Rall:
Packing Chromatic Number of Base-3 Sierpiński Graphs. Graphs Comb. 32(4): 1313-1327 (2016) - [j174]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): 387-390 (2016) - [j173]Bostjan Bresar, Paul Dorbec, Sandi Klavzar, Gasper Kosmrlj, Gabriel Renault:
Complexity of the game domination problem. Theor. Comput. Sci. 648: 1-7 (2016) - 2015
- [j172]Sandi Klavzar, Yoomi Rho:
On the Wiener index of generalized Fibonacci cubes and Lucas cubes. Discret. Appl. Math. 187: 155-160 (2015) - [j171]Kexiang Xu, Jinlan Wang, Kinkar Chandra Das, Sandi Klavzar:
Weighted Harary indices of apex trees and k-apex trees. Discret. Appl. Math. 189: 30-40 (2015) - [j170]Csilla Bujtás, Sandi Klavzar, Gasper Kosmrlj:
Domination game critical graphs. Discuss. Math. Graph Theory 35(4): 781-796 (2015) - [j169]Jernej Azarija, Sandi Klavzar, Jaehun Lee, Yoomi Rho:
Connectivity of Fibonacci cubes, Lucas cubes, and generalized cubes. Discret. Math. Theor. Comput. Sci. 17(1): 79-88 (2015) - [j168]Bostjan Bresar, Sandi Klavzar, Gasper Kosmrlj, Douglas F. Rall:
Guarded subgraphs and the domination game. Discret. Math. Theor. Comput. Sci. 17(1): 161-168 (2015) - [j167]Michael A. Henning, Sandi Klavzar, Douglas F. Rall:
Total Version of the Domination Game. Graphs Comb. 31(5): 1453-1462 (2015) - [j166]Sandi Klavzar, Zehui Shao:
Local colourings of Cartesian product graphs. Int. J. Comput. Math. 92(4): 694-699 (2015) - [j165]Jernej Azarija, Sandi Klavzar:
Moore Graphs and Cycles Are Extremal Graphs for Convex Cycles. J. Graph Theory 80(1): 34-42 (2015) - [i2]Bostjan Bresar, Paul Dorbec, Sandi Klavzar, Gasper Kosmrlj, Gabriel Renault:
Complexity of the Game Domination Problem. CoRR abs/1510.00140 (2015) - 2014
- [j164]Sandi Klavzar, Mohammad J. Nadjafi-Arani:
Computing distance moments on graphs with transitive Djoković-Winkler relation. Discret. Appl. Math. 166: 269-272 (2014) - [j163]Kannan Balakrishnan, Bostjan Bresar, Manoj Changat, Sandi Klavzar, Aleksander Vesel, Petra Zigert Pletersek:
Equal opportunity networks, distance-balanced graphs, and Wiener game. Discret. Optim. 12: 150-154 (2014) - [j162]Sandi Klavzar, Yoomi Rho:
Fibonacci (p, r)-cubes as Cartesian products. Discret. Math. 328: 23-26 (2014) - [j161]Bostjan Bresar, Paul Dorbec, Sandi Klavzar, Gasper Kosmrlj:
Domination game: Effect of edge- and vertex-removal. Discret. Math. 330: 1-10 (2014) - [j160]Sandi Klavzar, Mohammad J. Nadjafi-Arani:
On the difference between the revised Szeged index and the Wiener index. Discret. Math. 333: 28-34 (2014) - [j159]Sandi Klavzar, Mohammad J. Nadjafi-Arani:
Wiener index in weighted graphs via unification of Θ∗Θ∗-classes. Eur. J. Comb. 36: 71-76 (2014) - [j158]Sandi Klavzar, Mohammad J. Nadjafi-Arani:
Improved bounds on the difference between the Szeged index and the Wiener index of graphs. Eur. J. Comb. 39: 148-156 (2014) - [j157]Mohammad J. Nadjafi-Arani, Sandi Klavzar:
Cut method and Djoković-Winkler's relation. Electron. Notes Discret. Math. 45: 153-157 (2014) - [j156]Sandi Klavzar, Meijie Ma:
The domination number of exchanged hypercubes. Inf. Process. Lett. 114(4): 159-162 (2014) - [j155]Sandi Klavzar, Meijie Ma:
Average distance, surface area, and other structural properties of exchanged hypercubes. J. Supercomput. 69(1): 306-317 (2014) - 2013
- [b1]Andreas M. Hinz, Sandi Klavzar, Uros Milutinovic, Ciril Petr:
The Tower of Hanoi - Myths and Maths. Birkhäuser 2013, ISBN 978-3-0348-0236-9, pp. I-XV, 1-335 - [j154]Sandi Klavzar, Mohammad J. Nadjafi-Arani:
Wiener index versus Szeged index in networks. Discret. Appl. Math. 161(7-8): 1150-1153 (2013) - [j153]Bostjan Bresar, Sandi Klavzar, Gasper Kosmrlj, Douglas F. Rall:
Domination game: Extremal families of graphs for 3/53/5-conjectures. Discret. Appl. Math. 161(10-11): 1308-1316 (2013) - [j152]Bostjan Bresar, Sandi Klavzar, Douglas F. Rall:
Domination game played on trees and spanning subgraphs. Discret. Math. 313(8): 915-923 (2013) - [j151]Sandi Klavzar, Iztok Peterin, Sara Sabrina Zemljic:
Hamming dimension of a graph - The case of Sierpiński graphs. Eur. J. Comb. 34(2): 460-473 (2013) - [j150]Sandi Klavzar:
Structure of Fibonacci cubes: a survey. J. Comb. Optim. 25(4): 505-522 (2013) - 2012
- [j149]Aleksandar Ilic, Sandi Klavzar, Yoomi Rho:
Parity Index of Binary Words and Powers of Prime Words. Electron. J. Comb. 19(3): 44 (2012) - [j148]Sandi Klavzar, Khaled Salem:
A characterization of 1-cycle resonant graphs among bipartite 2-connected plane graphs. Discret. Appl. Math. 160(7-8): 1277-1280 (2012) - [j147]Aleksandar Ilic, Sandi Klavzar, Yoomi Rho:
Generalized Fibonacci cubes. Discret. Math. 312(1): 2-11 (2012) - [j146]Sandi Klavzar, Sergey V. Shpectorov:
Characterizing almost-median graphs II. Discret. Math. 312(2): 462-464 (2012) - [j145]R. Balakrishnan, R. B. Bapat, Sandi Klavzar, Ambat Vijayakumar, Thomas Zaslavsky, Xuding Zhu:
Preface. Discret. Math. 312(9): 1493 (2012) - [j144]Sandi Klavzar, Gasper Mekis:
On the rainbow connection of Cartesian products and their subgraphs. Discuss. Math. Graph Theory 32(4): 783-793 (2012) - [j143]Sandi Klavzar, Sergey V. Shpectorov:
Asymptotic number of isometric generalized Fibonacci cubes. Eur. J. Comb. 33(2): 220-226 (2012) - [j142]Bijo S. Anand, Manoj Changat, Sandi Klavzar, Iztok Peterin:
Convex Sets in Lexicographic Products of Graphs. Graphs Comb. 28(1): 77-84 (2012) - [j141]Bostjan Bresar, Paul Dorbec, Wayne Goddard, Bert L. Hartnell, Michael A. Henning, Sandi Klavzar, Douglas F. Rall:
Vizing's conjecture: a survey and recent results. J. Graph Theory 69(1): 46-76 (2012) - [j140]Sandi Klavzar, Sergey V. Shpectorov:
Convex excess in partial cubes. J. Graph Theory 69(4): 356-369 (2012) - [j139]Aleksandar Ilic, Sandi Klavzar, Yoomi Rho:
The index of a binary word. Theor. Comput. Sci. 452: 100-106 (2012) - 2011
- [j138]Aline Castro, Sandi Klavzar, Michel Mollard, Yoomi Rho:
On the domination number and the 2-packing number of Fibonacci cubes and Lucas cubes. Comput. Math. Appl. 61(9): 2655-2660 (2011) - [j137]Drago Bokal, Matt DeVos, Sandi Klavzar, Aki Mimoto, Arne Ø. Mooers:
Computing quadratic entropy in evolutionary trees. Comput. Math. Appl. 62(10): 3821-3828 (2011) - [j136]Sergio Cabello, David Eppstein, Sandi Klavzar:
The Fibonacci Dimension of a Graph. Electron. J. Comb. 18(1) (2011) - [j135]Sandi Klavzar, Michel Mollard, Marko Petkovsek:
The degree sequence of Fibonacci and Lucas cubes. Discret. Math. 311(14): 1310-1322 (2011) - [j134]Wilfried Imrich, Sandi Klavzar:
Two-ended regular median graphs. Discret. Math. 311(15): 1418-1422 (2011) - [j133]Sandi Klavzar, Gasper Mekis:
On Idomatic Partitions of Direct Products of Complete Graphs. Graphs Comb. 27(5): 713-726 (2011) - 2010
- [j132]Kannan Balakrishnan, Bostjan Bresar, Manoj Changat, Sandi Klavzar, Matjaz Kovse, Ajitha R. Subhamathi:
Computing median and antimedian sets in median graphs. Algorithmica 57(2): 207-216 (2010) - [j131]Sandi Klavzar, Khaled Salem, Andrej Taranenko:
Maximum cardinality resonant sets and maximal alternating sets of hexagonal systems. Comput. Math. Appl. 59(1): 506-513 (2010) - [j130]Sandi Klavzar, Dragan Marusic, Bojan Mohar, Tomaz Pisanski:
Preface. Discret. Math. 310(12): 1651-1652 (2010) - [j129]Janja Jerebic, Sandi Klavzar:
The distinguishing chromatic number of Cartesian products of two complete graphs. Discret. Math. 310(12): 1715-1720 (2010) - [j128]Laurent Beaudou, Sylvain Gravier, Sandi Klavzar, Matjaz Kovse, Michel Mollard:
Covering codes in Sierpinski graphs. Discret. Math. Theor. Comput. Sci. 12(3): 63-74 (2010) - [j127]Aleksandar Ilic, Sandi Klavzar, Marjan Milanovic:
On distance-balanced graphs. Eur. J. Comb. 31(3): 733-737 (2010) - [j126]Marko Jakovac, Sandi Klavzar:
The b-Chromatic Number of Cubic Graphs. Graphs Comb. 26(1): 107-118 (2010) - [j125]Kannan Balakrishnan, Bostjan Bresar, Matjaz Kovse, Manoj Changat, Ajitha R. Subhamathi, Sandi Klavzar:
Simultaneous embeddings of graphs as median and antimedian subgraphs. Networks 56(2): 90-94 (2010) - [j124]Bostjan Bresar, Sandi Klavzar, Douglas F. Rall:
Domination Game and an Imagination Strategy. SIAM J. Discret. Math. 24(3): 979-991 (2010)
2000 – 2009
- 2009
- [j123]Sandi Klavzar, Matjaz Kovse:
On Even and Harmonic-Even Partial Cubes. Ars Comb. 93 (2009) - [j122]Bostjan Bresar, Manoj Changat, Sandi Klavzar, Joseph Mathews, Antony Mathews, Prasanth G. Narasimha-Shenoi:
Characterizing posets for which their natural transit functions coincide. Ars Math. Contemp. 2(1): 27-33 (2009) - [j121]Khaled Salem, Sandi Klavzar, Aleksander Vesel, Petra Zigert:
The Clar formulas of a benzenoid system and the resonance graph. Discret. Appl. Math. 157(11): 2565-2569 (2009) - [j120]Kannan Balakrishnan, Bostjan Bresar, Manoj Changat, Wilfried Imrich, Sandi Klavzar, Matjaz Kovse, Ajitha R. Subhamathi:
On the remoteness function in median graphs. Discret. Appl. Math. 157(18): 3679-3688 (2009) - [j119]Marko Jakovac, Sandi Klavzar:
Vertex-, edge-, and total-colorings of Sierpinski-like graphs. Discret. Math. 309(6): 1548-1556 (2009) - [j118]Sandi Klavzar, Matjaz Kovse:
Induced cycles in crossing graphs of median graphs. Discret. Math. 309(23-24): 6585-6589 (2009) - [j117]Sandi Klavzar, Matjaz Kovse:
On semicube graphs. Eur. J. Comb. 30(1): 5-10 (2009) - [j116]Sandi Klavzar, Sergey V. Shpectorov:
Preface. Eur. J. Comb. 30(5): 1045-1047 (2009) - [j115]Jirí Fiala, Sandi Klavzar, Bernard Lidický:
The packing chromatic number of infinite product graphs. Eur. J. Comb. 30(5): 1101-1113 (2009) - [j114]Wilfried Imrich, Sandi Klavzar:
Transitive, Locally Finite Median Graphs with Finite Blocks. Graphs Comb. 25(1): 81-90 (2009) - [i1]Sergio Cabello, David Eppstein, Sandi Klavzar:
The Fibonacci dimension of a graph. CoRR abs/0903.2507 (2009) - 2008
- [j113]Kannan Balakrishnan, Manoj Changat, Sandi Klavzar, Joseph Mathews, Iztok Peterin, G. N. Prasanth, Simon Spacapan:
Antimedian graphs. Australas. J Comb. 41: 159-170 (2008) - [j112]Kannan Balakrishnan, Manoj Changat, Sandi Klavzar:
The median function on graphs with bounded profiles. Discret. Appl. Math. 156(15): 2882-2889 (2008) - [j111]Bostjan Bresar, Sandi Klavzar, Aleksandra Tepeh Horvat:
On the geodetic number and related metric sets in Cartesian product graphs. Discret. Math. 308(23): 5555-5561 (2008) - [j110]Wilfried Imrich, Janja Jerebic, Sandi Klavzar:
The distinguishing number of Cartesian products of complete graphs. Eur. J. Comb. 29(4): 922-929 (2008) - [j109]Douglas F. Rall, Bostjan Bresar, Art S. Finbow, Sandi Klavzar:
On the Packing Chromatic Number of Trees, Cartesian Products and Some Infinite Graphs. Electron. Notes Discret. Math. 30: 57-61 (2008) - [j108]Bostjan Bresar, Manoj Changat, Sandi Klavzar, Matjaz Kovse, Joseph Mathews, Antony Mathews:
Cover-Incomparability Graphs of Posets. Order 25(4): 335-347 (2008) - [j107]Paul Dorbec, Michel Mollard, Sandi Klavzar, Simon Spacapan:
Power Domination in Product Graphs. SIAM J. Discret. Math. 22(2): 554-567 (2008) - [j106]Zhendong Shao, Sandi Klavzar, Wai Chee Shiu, David Zhang:
Improved Bounds on the L(2, 1)-Number of Direct and Strong Products of Graphs. IEEE Trans. Circuits Syst. II Express Briefs 55-II(7): 685-689 (2008) - 2007
- [j105]Sandi Klavzar, Uros Milutinovic, Ciril Petr:
Stern polynomials. Adv. Appl. Math. 39(1): 86-95 (2007) - [j104]Khaled Salem, Sandi Klavzar:
On plane bipartite graphs without fixed edges. Appl. Math. Lett. 20(7): 813-816 (2007) - [j103]Wilfried Imrich, Sandi Klavzar, Vladimir Ivanovich Trofimov:
Distinguishing Infinite Graphs. Electron. J. Comb. 14(1) (2007) - [j102]Dalibor Froncek, Janja Jerebic, Sandi Klavzar, Petr Kovár:
Strong Isometric Dimension, Biclique Coverings, and Sperner's Theorem. Comb. Probab. Comput. 16(2): 271-275 (2007) - [j101]Bostjan Bresar, Sandi Klavzar, Douglas F. Rall:
On the packing chromatic number of Cartesian products, hexagonal lattice, and trees. Discret. Appl. Math. 155(17): 2303-2311 (2007) - [j100]Wilfried Imrich, Sandi Klavzar, Douglas F. Rall:
Cancellation properties of products of graphs. Discret. Appl. Math. 155(17): 2362-2364 (2007) - [j99]Bostjan Bresar, Jaroslaw Grytczuk, Sandi Klavzar, Staszek Niwczyk, Iztok Peterin:
Nonrepetitive colorings of trees. Discret. Math. 307(2): 163-172 (2007) - [j98]Sandi Klavzar, Dragan Marusic, Bojan Mohar, Tomaz Pisanski:
Preface. Discret. Math. 307(3-5): 299 (2007) - [j97]Bostjan Bresar, Sandi Klavzar, Riste Skrekovski:
On cube-free median graphs. Discret. Math. 307(3-5): 345-351 (2007) - [j96]Bostjan Bresar, Sandi Klavzar:
Maximal proper subgraphs of median graphs. Discret. Math. 307(11-12): 1389-1394 (2007) - [j95]Bostjan Bresar, Sandi Klavzar, Douglas F. Rall:
Dominating direct products of graphs. Discret. Math. 307(13): 1636-1642 (2007) - [j94]Sandi Klavzar, Matjaz Kovse:
On Tetha-graphs of partial cubes. Discuss. Math. Graph Theory 27(2): 313-321 (2007) - [j93]Sandi Klavzar, Sergey V. Shpectorov:
Tribes of Cubic Partial Cubes. Discret. Math. Theor. Comput. Sci. 9(1) (2007) - [j92]Sandi Klavzar, Xuding Zhu:
Cartesian powers of graphs can be distinguished by two labels. Eur. J. Comb. 28(1): 303-310 (2007) - [j91]Sandi Klavzar, Matjaz Kovse:
Partial cubes and their tau-graphs. Eur. J. Comb. 28(4): 1037-1042 (2007) - [j90]Bostjan Bresar, Paul Dorbec, Sandi Klavzar, Michel Mollard:
Hamming polynomials and their partial derivatives. Eur. J. Comb. 28(4): 1156-1162 (2007) - [j89]Bostjan Bresar, Sandi Klavzar, Douglas F. Rall:
On the packing chromatic number of Cartesian products, hexagonal lattice, and trees. Electron. Notes Discret. Math. 29: 237-241 (2007) - [j88]Bostjan Bresar, Sandi Klavzar:
Crossing Graphs as Joins of Graphs and Cartesian Products of Median Graphs. SIAM J. Discret. Math. 21(1): 26-32 (2007) - 2006
- [j87]Sandi Klavzar, Simon Spacapan, Janez Zerovnik:
An almost complete description of perfect codes in direct products of cycles. Adv. Appl. Math. 37(1): 2-18 (2006) - [j86]Sandi Klavzar, Ivan Gutman:
A theorem on Wiener-type invariants for isometric subgraphs of hypercubes. Appl. Math. Lett. 19(10): 1129-1133 (2006) - [j85]Khaled Salem, Sandi Klavzar, Ivan Gutman:
On the role of hypercubes in the resonance graphs of benzenoid graphs. Discret. Math. 306(7): 699-704 (2006) - [j84]Bostjan Bresar, Sandi Klavzar:
Theta-graceful labelings of partial cubes. Discret. Math. 306(13): 1264-1271 (2006) - [j83]Janja Jerebic, Sandi Klavzar:
On induced and isometric embeddings of graphs into the strong product of paths. Discret. Math. 306(13): 1358-1363 (2006) - [j82]Sandi Klavzar:
Counting hypercubes in hypercubes. Discret. Math. 306(22): 2964-2967 (2006) - [j81]Paul Dorbec, Sylvain Gravier, Sandi Klavzar, Simon Spacapan:
Some results on total domination in direct products of graphs. Discuss. Math. Graph Theory 26(1): 103-112 (2006) - [j80]Sandi Klavzar:
On the canonical metric representation, average distance, and partial Hamming graphs. Eur. J. Comb. 27(1): 68-73 (2006) - [j79]Bostjan Bresar, Sandi Klavzar, Riste Skrekovski:
Roots of cube polynomials of median graphs. J. Graph Theory 52(1): 37-50 (2006) - [j78]Wilfried Imrich, Sandi Klavzar:
Distinguishing Cartesian powers of graphs. J. Graph Theory 53(3): 250-260 (2006) - [j77]Sandi Klavzar, Simon Spacapan:
The Δ2-conjecture for L(2, 1)-labelings is true for direct and strong products of graphs. IEEE Trans. Circuits Syst. II Express Briefs 53-II(4): 274-277 (2006) - 2005
- [j76]Sandi Klavzar:
Some new bounds and exact results on the independence number of Cartesian product graphs. Ars Comb. 74 (2005) - [j75]Pranava K. Jha, Sandi Klavzar, Aleksander Vesel:
L(2, 1)-labeling of direct product of paths and cycles. Discret. Appl. Math. 145(2): 317-325 (2005) - [j74]Pranava K. Jha, Sandi Klavzar, Aleksander Vesel:
Optimal L(d, 1)-labelings of certain direct products of cycles and Cartesian products of cycles. Discret. Appl. Math. 152(1-3): 257-265 (2005) - [j73]Bostjan Bresar, Wilfried Imrich, Sandi Klavzar:
Reconstructing subgraph-counting graph polynomials of increasing families of graphs. Discret. Math. 297(1-3): 159-166 (2005) - [j72]Sandi Klavzar:
On median nature and enumerative properties of Fibonacci-like cubes. Discret. Math. 299(1-3): 145-153 (2005) - [j71]Bostjan Bresar, Pranava K. Jha, Sandi Klavzar, Blaz Zmazek:
Median and quasi-median direct products of graphs. Discuss. Math. Graph Theory 25(1-2): 183-196 (2005) - [j70]Andreas M. Hinz, Sandi Klavzar, Uros Milutinovic, Daniele Parisse, Ciril Petr:
Metric properties of the Tower of Hanoi graphs and Stern's diatomic sequence. Eur. J. Comb. 26(5): 693-708 (2005) - [j69]Janja Jerebic, Sandi Klavzar, Simon Spacapan:
Characterizing r-perfect codes in direct products of two and three cycles. Inf. Process. Lett. 94(1): 1-6 (2005) - [j68]Sandi Klavzar, Iztok Peterin:
Characterizing subgraphs of Hamming graphs. J. Graph Theory 49(4): 302-312 (2005) - [j67]Sandi Klavzar, Bojan Mohar:
Crossing numbers of Sierpinski-like graphs. J. Graph Theory 50(3): 186-198 (2005) - [j66]Bostjan Bresar, Wilfried Imrich, Sandi Klavzar, Blaz Zmazek:
Hypercubes As Direct Products. SIAM J. Discret. Math. 18(4): 778-786 (2005) - 2004
- [j65]Bostjan Bresar, Sandi Klavzar:
Square-free colorings of graphs. Ars Comb. 70 (2004) - [j64]Sandi Klavzar, Alenka Lipovec:
Edge-critical isometric subgraphs of hypercubes. Ars Comb. 70 (2004) - [j63]Bostjan Bresar, Sandi Klavzar, Alenka Lipovec, Bojan Mohar:
Cubic inflation, mirror graphs, regular maps, and partial cubes. Eur. J. Comb. 25(1): 54-64 (2004) - 2003
- [j62]C. Paul Bonnington, Sandi Klavzar, Alenka Lipovec:
On cubic and edge-critical isometric subgraphs of hypercubes. Australas. J Comb. 28: 217-224 (2003) - [j61]Bostjan Bresar, Sandi Klavzar, Riste Skrekovski:
The Cube Polynomial and its Derivatives: the Case of Median Graphs. Electron. J. Comb. 10 (2003) - [j60]Sandi Klavzar, Aleksander Vesel:
Computing graph invariants on rotagraphs using dynamic algorithm approach: the case of (2, 1)-colorings and independence numbers. Discret. Appl. Math. 129(2-3): 449-460 (2003) - [j59]Bostjan Bresar, Wilfried Imrich, Sandi Klavzar:
Fast recognition algorithms for classes of partial cubes. Discret. Appl. Math. 131(1): 51-61 (2003) - [j58]Sandi Klavzar, Alenka Lipovec:
Partial cubes as subdivision graphs and as generalized Petersen graphs. Discret. Math. 263(1-3): 157-165 (2003) - [j57]Sylvain Gravier, Sandi Klavzar, Michel Mollard:
Isometric embeddings of subdivided wheels in hypercubes. Discret. Math. 269(1-3): 287-293 (2003) - [j56]Sandi Klavzar, Bojan Mohar, Tomaz Pisanski, Norbert Seifter, Janez Zerovnik:
Preface. Discuss. Math. Graph Theory 23(2): 205 (2003) - [j55]Bostjan Bresar, Wilfried Imrich, Sandi Klavzar:
Tree-like isometric subgraphs of hypercubes. Discuss. Math. Graph Theory 23(2): 227-240 (2003) - [j54]Bostjan Bresar, Sandi Klavzar, Riste Skrekovski:
Quasi-median graphs, their generalizations, and tree-like equalities. Eur. J. Comb. 24(5): 557-572 (2003) - 2002
- [j53]Sandi Klavzar, Petra Zigert:
A min-max result on catacondensed benzenoid graphs. Appl. Math. Lett. 15(3): 279-283 (2002) - [j52]Sandi Klavzar, Uros Milutinovic, Ciril Petr:
On the Frame-Stewart algorithm for the multi-peg Tower of Hanoi problem. Discret. Appl. Math. 120(1-3): 141-157 (2002) - [j51]Sandi Klavzar, Dragan Marusic, Bojan Mohar:
Preface. Discret. Math. 244(1-3): 1-4 (2002) - [j50]Sandi Klavzar, Alenka Lipovec, Marko Petkovsek:
On subgraphs of Cartesian product graphs. Discret. Math. 244(1-3): 223-230 (2002) - [j49]Sandi Klavzar, Hong-Gwa Yeh:
On the fractional chromatic number, the chromatic number, and graph products. Discret. Math. 247(1-3): 235-242 (2002) - [j48]Sandi Klavzar, Petra Zigert, Gunnar Brinkmann:
Resonance graphs of catacondensed even ring systems are median. Discret. Math. 253(1-3): 35-43 (2002) - [j47]Gordon G. Cash, Sandi Klavzar, Marko Petkovsek:
Three Methods for Calculation of the Hyper-Wiener Index of Molecular Graphs. J. Chem. Inf. Comput. Sci. 42(3): 571-576 (2002) - [j46]Bostjan Bresar, Wilfried Imrich, Sandi Klavzar, Henry Martyn Mulder, Riste Skrekovski:
Tiled partial cubes. J. Graph Theory 40(2): 91-103 (2002) - [j45]Sandi Klavzar, Henry Martyn Mulder:
Partial Cubes and Crossing Graphs. SIAM J. Discret. Math. 15(2): 235-251 (2002) - 2001
- [j44]Sandi Klavzar, Uros Milutinovic, Ciril Petr:
Combinatorics of topmost discs of multi-peg Tower of Hanoi problem. Ars Comb. 59 (2001) - [j43]Sandi Klavzar, Aleksander Vesel, Petra Zigert, Ivan Gutman:
Binary Coding of Kekulé Structures of Catacondensed Benzenoid Hydrocarbons. Comput. Chem. 25(6): 569-575 (2001) - [j42]Bostjan Bresar, Sandi Klavzar, Riste Skrekovski:
Cubes polynomial and its derivatives. Electron. Notes Discret. Math. 10: 47-49 (2001) - 2000
- [j41]Sandi Klavzar, Petra Zigert, Ivan Gutman:
An Algorithm for the Calculation of the Hyper-Wiener Index of Benzenoid Hydrocarbons. Comput. Chem. 24(2): 229-233 (2000) - [j40]Sandi Klavzar, Riste Skrekovski:
On median graphs and median grid graphs. Discret. Math. 219(1-3): 287-293 (2000)
1990 – 1999
- 1999
- [j39]Wilfried Imrich, Sandi Klavzar:
Recognizing Graphs of Acyclic Cubical Complexes. Discret. Appl. Math. 95(1-3): 321-330 (1999) - [j38]Sandi Klavzar, Uros Milutinovic, Ciril Petr:
On the Frame-Stewarr algorithm for the multi-peg Tower of Hanoi problem (Extended Abstract). Electron. Notes Discret. Math. 3: 90-93 (1999) - [j37]Sandi Klavzar, Jack H. Koolen, Henry Martyn Mulder:
Graphs which Locally Mirror the Hypercube Structure. Inf. Process. Lett. 71(2): 87-90 (1999) - [j36]Wilfried Imrich, Sandi Klavzar, Henry Martyn Mulder:
Median Graphs and Triangle-Free Graphs. SIAM J. Discret. Math. 12(1): 111-118 (1999) - [j35]Johann Hagauer, Wilfried Imrich, Sandi Klavzar:
Recognizing Median Graphs in Subquadratic Time. Theor. Comput. Sci. 215(1-2): 123-136 (1999) - [c2]Franc Novak, Bojan Hvala, Sandi Klavzar:
On Analog Signature Analysis. DATE 1999: 249- - 1998
- [j34]Wilfried Imrich, Sandi Klavzar, Aleksander Vesel:
A characterization of halved cubes. Ars Comb. 48 (1998) - [j33]Pranava K. Jha, Sandi Klavzar:
Independence in Direct-Product Graphs. Ars Comb. 50 (1998) - [j32]Sandi Klavzar:
On the fractional chromatic number and the lexicographic product of graphs. Discret. Math. 185(1-3): 259-263 (1998) - [j31]Sandi Klavzar, Henry Martyn Mulder, Riste Skrekovski:
An Euler-type formula for median graphs. Discret. Math. 187(1-3): 255-258 (1998) - [j30]Victor Chepoi, Sandi Klavzar:
Distances in benzenoid systems: Further developments. Discret. Math. 192(1-3): 27-39 (1998) - [j29]Wilfried Imrich, Sandi Klavzar:
A Convexity Lemma and Expansion Procedures for Bipartite Graphs. Eur. J. Comb. 19(6): 677-685 (1998) - [c1]Sandi Klavzar:
Applications of isometric embeddings to chemical graphs. Discrete Mathematical Chemistry 1998: 249-259 - 1997
- [j28]Joze Rugelj, Sandi Klavzar:
Distributed multicast routing in point-to-point networks. Comput. Oper. Res. 24(6): 521-527 (1997) - [j27]Sandi Klavzar, Ivan Gutman:
Wiener Number of Vertex-weighted Graphs and a Chemical Application. Discret. Appl. Math. 80(1): 73-81 (1997) - [j26]Pranava K. Jha, Sandi Klavzar, Blaz Zmazek:
Isomorphic components of Kronecker product of bipartite graphs. Discuss. Math. Graph Theory 17(2): 301-309 (1997) - [j25]Wilfried Imrich, Sandi Klavzar:
Recognizing Hamming Graphs in Linear Time and space. Inf. Process. Lett. 63(2): 91-95 (1997) - [j24]Ivan Gutman, Sandi Klavzar:
Bounds for the Schultz Molecular Topological Index of Benzenoid Systems in Terms of the Wiener Index. J. Chem. Inf. Comput. Sci. 37(4): 741-744 (1997) - [j23]Victor Chepoi, Sandi Klavzar:
The Wiener Index and the Szeged Index of Benzenoid Systems in Linear Time. J. Chem. Inf. Comput. Sci. 37(4): 752-755 (1997) - 1996
- [j22]Johann Hagauer, Sandi Klavzar:
On independence numbers of the cartesian product of graphs. Ars Comb. 43 (1996) - [j21]Sandi Klavzar, Janez Zerovnik:
Algebraic Approach to Fasciagraphs and Rotagraphs. Discret. Appl. Math. 68(1-2): 93-100 (1996) - [j20]Sandi Klavzar:
Coloring graph products - A survey. Discret. Math. 155(1-3): 135-145 (1996) - [j19]Sandi Klavzar, Blaz Zmazek:
On a Vizing-like conjecture for direct product graphs. Discret. Math. 156(1-3): 243-246 (1996) - [j18]Johann Hagauer, Sandi Klavzar:
Clique-gated graphs. Discret. Math. 161(1-3): 143-149 (1996) - [j17]Wilfried Imrich, Sandi Klavzar:
On the Complexity of Recognizing Hamming Graphs and Related Classes of Graphs. Eur. J. Comb. 17(2-3): 209-221 (1996) - [j16]Sandi Klavzar, Ivan Gutman:
A Comparison of the Schultz Molecular Topological Index with the Wiener Index. J. Chem. Inf. Comput. Sci. 36(5): 1001-1003 (1996) - 1995
- [j15]Sandi Klavzar, Norbert Seifter:
Dominating Cartesian Products of Cycles. Discret. Appl. Math. 59(2): 129-136 (1995) - [j14]Sandi Klavzar, Bojan Mohar:
The chromatic numbers of graph bundles over cycles. Discret. Math. 138(1-3): 301-314 (1995) - [j13]Wilfried Imrich, Sandi Klavzar, Aleksander Vesel:
Recognizing halved cubes in a constant time per edge. Eur. J. Comb. 16(6): 617-621 (1995) - [j12]Sandi Klavzar, Ivan Gutman, Bojan Mohar:
Labeling of Benzenoid Systems which Reflects the Vertex-Distance Relations. J. Chem. Inf. Comput. Sci. 35(3): 590-593 (1995) - [j11]Martin Juvan, Bojan Mohar, Ante Graovac, Sandi Klavzar, Janez Zerovnik:
Fast computation of the Wiener index of fasciagraphs and rotagraphs. J. Chem. Inf. Comput. Sci. 35(5): 834-840 (1995) - [j10]Ivan Gutman, Sandi Klavzar:
An Algorithm for the Calculation of the Szeged Index of Benzenoid Hydrocarbons. J. Chem. Inf. Comput. Sci. 35(6): 1011-1014 (1995) - [j9]Sandi Klavzar, Bojan Mohar:
Coloring graph bundles. J. Graph Theory 19(2): 145-155 (1995) - 1994
- [j8]Vladimir Batagelj, Simona Korenjak-Cerne, Sandi Klavzar:
Dynamic Programming and Convex Clustering. Algorithmica 11(2): 93-103 (1994) - [j7]Sandi Klavzar, Uros Milutinovic:
Strong products of Kneser graphs. Discret. Math. 133(1-3): 297-300 (1994) - [j6]Niko Cizek, Sandi Klavzar:
On the chromatic number of the lexicographic product and the Cartesian sum of graphs. Discret. Math. 134(1-3): 17-24 (1994) - [j5]Sandi Klavzar:
Absolute retracts of split graphs. Discret. Math. 134(1-3): 75-84 (1994) - 1992
- [j4]Wilfried Imrich, Sandi Klavzar:
Retracts of strong products of graphs. Discret. Math. 109(1-3): 147-154 (1992) - [j3]Sandi Klavzar:
Two remarks on retracts of graph products. Discret. Math. 109(1-3): 155-160 (1992)
1980 – 1989
- 1988
- [j2]Franc Novak, Sandi Klavzar, Ludvik Gyergyek:
On system diagnosis for transient fault situations. Microprocess. Microprogramming 22(4): 273-275 (1988) - 1987
- [j1]Sandi Klavzar, Marko Petkovsek:
Intersection graphs of halflines and halfplanes. Discret. Math. 66(1-2): 133-137 (1987)
Coauthor Index
[j266] [j258] [j257] [j256] [j251] [i6] [j235] [j220] [j216] [j205] [j203] [j188] [j187] [j186] [j179] [j175] [j173] [j168] [i2] [j163] [j161] [j153] [j152] [j141] [j132] [j125] [j124] [j122] [j120] [j111] [j109] [j108] [j101] [j99] [j97] [j96] [j95] [j90] [j89] [j88] [j84] [j79] [j73] [j71] [j66] [j65] [j63] [j61] [j59] [j55] [j54] [j46] [j42]
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-11-07 20:33 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
