Sandi Klavžar - preprints

 
  • Strong geodetic cores and Cartesian product graphs (with V. Gledel, V. Iršič)

  •  
     
  • Nordhaus-Gaddum and other bounds for the chromatic edge stability number (with S. Akbari, N. Movarraei, M. Nahvi)

  •  
     
  • Distribution of global defensive k-alliances over some graph products (with M. Tavakoli)

  •  
     
  • Cutting Lemma and Union Lemma for the domination game (with P. Dorbec, M.A. Henning, G. Košmrlj)

  •  
     
  • Metric properties of generalized Sierpiński graphs over stars (with Y. Alizadeh, E. Estaji, M. Petkovšek)

  •  
     
  • General transmission lemma and Wiener complexity of triangular grids (with D. Azubha Jemilet, I. Rajasingh, P. Manuel, N. Parthiban)

  •  
     
  • On Grundy total domination number in product graphs (with B. Brešar, Cs. Bujtás, T. Gologranc, G. Košmrlj, T. Marc, B. Patkós, Zs. Tuza, M. Vizer)

  •  
     
  • The graph theory general position problem on some interconnection networks (with P. Manuel)

  •  
     
  • Trees with distinguishing index equal distinguishing number plus one (with S. Alikhani, F. Lehner, S. Soltani)

  •  
     
  • Complexity of the Szeged index, edge orbits, and some nanotubical fullerenes (with Y. Alizadeh)

  •  
     
  • Constructing uniform central graphs and embedding into them (with K.P. Narayankar, Lokesh S B)

  •  
     
  • Simplified constructions of almost peripheral graphs and improved embeddings into them (with K.P. Narayankar, S.P. Narayankar, D. Shubhalakshmi)

  •  
     
  • Embeddings into almost self-centered graphs of given radius (with K. Xu, H. Liu, K.Ch. Das)

  •  
     
  • Infinite families of circular and Möbius ladders that are total domination game critical (with M. Henning)

  • to appear in Bull. Malays. Math. Sci. Soc.
     
  • A general position problem in graph theory (with P. Manuel)

  • to appear in Bull. Aust. Math. Soc.
     
  • Connectivity and some other properties of generalized Sierpiński graphs (with S.S. Zemljič)

  • to appear in Appl. Anal. Discrete Math.
     
  • Game total domination critical graphs (with M. Henning, D. F. Rall)

  • to appear in Discrete Appl. Math.
     
  • Strong geodetic problem in networks (with P. Manuel, A. Xavier, A. Arokiaraj, E. Thomas)

  • to appear in Discuss. Math. Graph Theory
     
  • Strong geodetic problem in grid like architectures (with P. Manuel)

  • to appear in Bull. Malays. Math. Sci. Soc.
     
  • On the difference between the (revised) Szeged index and the Wiener index of cacti (with S. Li, H. Zhang)

  • to appear in Discrete Appl. Math.
     
  • Strong geodetic problem on Cartesian products of graphs (with V. Iršič)

  • to appear in RAIRO Oper. Res.
     
  • Packing chromatic number versus chromatic and clique number (with B. Brešar, D.F. Rall, K. Wash)

  • to appear in Aequationes Math.
     
  • Daisy cubes and distance cube polynomial (with M. Mollard)

  • to appear in European J. Combin.
     
  • On graphs with largest possible game domination number (with K. Xu, X. Li)

  • Discrete Math. 341 (2018) 1768-1777.
     
  • On graphs whose Wiener complexity equals their order and on Wiener index of asymmetric graphs (with Y. Alizadeh)

  • Appl. Math. Comput. 328 (2018) 113-118.
     
  • Partition distance in graphs (with M. J. Nadjafi-Arani)

  • J. Math. Chem. 56 (2018) 69-80.
     
  • On domination-type invariants of Fibonacci cubes and hypercubes (with J. Azarija, Y. Rho, S. Sim)

  • Ars Math. Contemp. 14 (2018) 387-395.