List of papers

• 379. Resolvability and convexity properties in the Sierpiński product of graphs (with M.A. Henning, I.G. Yero), Mediterr. J. Math. 21(1) (2024) paper 3, 17 pp.   PDF
• 378. Traversing a graph in general position (with A. Krishnakumar, J. Tuite, I.G. Yero), Bull. Aust. Math. Soc. 108 (2023) 353-365.   PDF
• 377. On mixed metric dimension in subdivision, middle, and total graphs (with A. Ghalavand, M. Tavakoli, I.G. Yero), Quaest. Math. 46 (2023) 2517-2527.   PDF
• 376. Partial domination in supercubic graphs (with Cs. Bujtás, M. Henning), Discrete Math. 347 (2024) Paper 113669, 11 pp.   PDF
• 375. Maker-Breaker domination game on trees when Staller wins (with Cs. Bujtás, P. Dokyeesun), Discrete Math. Theor. Comput. Sci. 25(2) (2023) paper 12, 21 pp.   PDF
• 374. Computational complexity aspects of super domination (with Cs. Bujtás, N. Ghanbari), Theoret. Comput. Sci. 975 (2023) paper 114137, 14 pp.   PDF
• 373. Geodesic packing in graphs (with P. Manuel, B. Brešar), Appl. Math. Comput. 459 (2023) paper 128277, 7 pp.   PDF
• 372. Variety of mutual-visibility problems in graphs (with S. Cicerone, G. Di Stefano, L. Drožđek, J. Hedžet, I.G. Yero), Theoret. Comput. Sci. 974 (2023) paper 114096, 13 pp.   PDF
• 371. New transmission irregular chemical graphs (with K. Xu, J. Tian), Discrete Appl. Math. 340 (2023) 286-295.   PDF
• 370. The cut method on hypergraphs for the Wiener index (with G.D. Romih), J. Math. Chem. 61 (2023) 1592-1603.   PDF
• 369. Graphs whose mixed metric dimension is equal to their order (with A. Ghalavand, M. Tavakoli), Comput. Appl. Math. 42 (2023) paper 210, 7 pp.   PDF
• 368. A characterization of 4-χ_S-vertex-critical graphs for packing sequences with s₁ = 1 and s₂ ≧ 3 (with H. Lei, X. Lian, Y. Shi), Discrete Appl. Math. 338 (2023) 46-55.   PDF
• 367. Edge general position sets in Fibonacci and Lucas cubes (with E. Tan), Bull. Malays. Math. Sci. Soc. 46 (2023) paper 120, 11 pp.   PDF
• 366. A note on eccentricity based topological indices of honeycomb, oxide and 2-power interconnection networks (with G.K. Nandini, T.M. Rajalaxmi, R.S. Rajan), J. Discrete Math. Sci. Cryptogr.26 (2023) 231-253.   PDF
• 365. Redefining fractal cubic networks and determining their metric dimension and fault-tolerent metric dimension (with M. Arulperumjothi, S. Prabhu), Appl. Math. Comput. 452 (2023) paper 128037, 6 pp.   PDF
• 364. Thresholds for the monochromatic clique transversal game (with Cs. Bujtás, P. Dokyeesun), Expo. Math. 41 (2023) 202-219.   PDF
• 363. Extremal results on stepwise transmission irregular graphs (with Y. Alizadeh), Filomat 37 (2023) 1271-1276.   PDF
• 362. The geodesic transversal problem on some networks (with P. Manuel, B. Brešar), Comput. Appl. Math. 42 (2023) paper 59, 12 pp.   PDF
• 361. Further contributions on the outer multiset dimension of graphs (with D. Kuziak, I.G. Yero), Results Math. 78 (2023) 50.   PDF
• 360. Nonlocal metric dimension of graphs (with D. Kuziak), Bull. Malays. Math. Sci. Soc. 46 (2023) paper 66, 14 pp.   PDF
• 359. Orientable domination in product-like graphs (with S. Anderson, B. Brešar, K. Kuenzel, D.F. Rall), Discrete Appl. Math. 326 (2023) 62-69.   PDF
• 358. On the mutual visibility in Cartesian products and triangle-free graphs (with S. Cicerone, G. Di Stefano), Appl. Math. Comput. 438 (2023) paper 127619, 9 pp.   PDF
• 357. Leap eccentric connectivity index in graphs with universal vertices (with A. Ghalavand, M. Tavakoli, M. Hakimi-Nezhaad, F. Rahbarnia), Appl. Math. Comput. 436 (2023) paper 127519, 8 pp.   PDF
• 356. How to compute the M-polynomial of (chemical) graphs (with E. Deutsch, G.D. Romih), MATCH Commun. Math. Comput. Chem. 89 (2023) 275-285.   PDF
• 355. Global forcing number for maximal matchings in corona products (with M. Tavakoli, G. Abrishami), Aequationes Math. 96 (2022) 997-1005.   PDF
• 354. Edge general position problem (with P. Manuel, R. Prabha), Bull. Malays. Math. Sci. Soc. 45 (2022) 2997-3009.   PDF
• 353. Some extremal results on the chromatic-stability index (with S. Huang, H. Lei, X. Lian, Y. Shi), Bull. Aust. Math. Soc. 106 (2022) 185-194.   PDF
• 352. Relativistic topological and spectral characteristics of zeolite SAS structures (with M. Arockiaraj, D. Paul, J. Clement, S. Tigga, K. Balasubramanian), J. Mol. Struct. 1270 (2022) paper 133854, 13 pp.   PDF
• 351. The general position achievement game played on graphs (with Neethu P.K., U. Chandran S.V.), Discrete Appl. Math. 317 (2022) 109-116.   PDF
• 350. Relating the total domination number and the annihilation number for quasi-trees and some composite graphs (with H. Hua, X. Hua, K. Xu), Discrete Math. 345 (2022) paper 112965, 9 pp.   PDF
• 349. Comment on Mostar indices of SiO₂ nanostructures and melem chain nanostructures (with S. Mushtaq, M. Arockiaraj, J.C. Fiona, K. Balasubramanian), Int. J. Quantum Chem. 122(11) (2022) paper e26894, 5 pp.   PDF
• 348. Predominating a vertex in the connected domination game (with Cs. Bujtás, V. Iršič), Graphs Combin. 38 (2022) paper 77, 21 pp.   PDF
• 347. The domination game played on diameter 2 graphs (with Cs. Bujtás, V. Iršič, K. Xu), Aequationes Math. 96 (2022) 187-199.   PDF
• 346. Szeged-like topological indices and the efficacy of the cut method: The case of melem structures (with M. Arockiaraj, S. Mushtaq, J.C. Fiona, K. Balasubramanian), Discrete Math. Lett. 9 (2022) 49-56.   PDF
• 345. On the chromatic vertex stability number of graphs (with S. Akbari, A. Beikmohammadi, N. Movarraei), European J. Combin. 102 (2022) 103504, 7 pp.   PDF
• 344. Twin vertices in fault-tolerant metric sets and fault-tolerant metric dimension of multistage interconnection networks (with S. Prabhu, V. Manimozhi, M. Arulperumjothi), Appl. Math. Comput. 420 (2022) 126897, 6 pp.   PDF
• 343. 1/2-conjectures on the domination game and claw-free graphs (with Cs. Bujtás, V. Iršič), European J. Combin. 101 (2022) paper 103467, 17 pp.   PDF
• 342. Relativistic distance based and bond additive topological descriptors of zeolite RHO materials (with M. Arockiaraj, D. Paul, J. Clement, S. Tigga, K. Balasubramanian), J. Mol. Struct. 1250 (2022) paper 131798, 14 pp.   PDF
• 341. The geodesic-transversal problem (with P. Manuel, B. Brešar), Appl. Math. Comput. 413 (2022) paper 126621, 11 pp.   PDF
• 340. On the Mostar index of trees and product graphs (with Y. Alizadeh, K. Xu), Filomat 35 (2021) 4637-4643.   PDF
• 339. On Rall's 1/2-conjecture on the domination game (with Cs. Bujtás, V. Iršič, K. Xu), Quaest. Math. 44 (2021) 1711-1727.   PDF
• 338. Topological characterization of the full k-subdivision of a family of partial cubes and their applications to α-types of novel graphyne and graphdiyne materials (with M. Arockiaraj, S. Mushtaq, K. Balasubramanian), Polycycl. Aromat. Comp. 41 (2021) 1902-1924.   PDF
• 337. The Steiner k-eccentricity on trees (with X. Li, G. Yu, J. Hu, B. Li), Theoret. Comput. Sci. 889 (2021) 182-188.   PDF
• 336. A Steiner general position problem in graph theory (with D. Kuziak, I. Peterin, I.G. Yero), Comput. Appl. Math. 40 (2021) paper 223, 15 pp.   PDF
• 335. On the Djoković-Winkler relation and its closure in subdivisions of fullerenes, triangulations, and chordal graphs (with K. Knauer, T. Marc), MATCH Commun. Math. Comput. Chem. 86 (2021) 327-342.   PDF
• 334. Total connected domination game (with Cs. Bujtás, M. Henning, V. Iršič), Opuscula Math. 41 (2021) 453-464.   PDF
• 333. Edge metric dimensions via hierarchical product and integer linear programming (with M. Tavakoli), Optim. Lett. 15 (2021) 1993-2003.   PDF
• 332. Correcting the algorithm for the secure domination number of cographs by Jha, Pradhan, and Banerjee (with A. Kišek), Inform. Proc. Lett. 172 (2021) paper 106155, 4 pp.   PDF
• 331. On the average Steiner 3-eccentricity of trees (with X. Li, G. Yu), Discrete Appl. Math. 304 (2021) 181-195.   PDF
• 330. General d-position sets (with D.F. Rall, I.G. Yero), Ars Math. Contemp. 21 (2021) #P1.03.   PDF
• 329. An asymptotic relation between the wirelength of an embedding and the Wiener index (with K.J. Kumar, R.S. Rajan, I. Rajasingh, T.M. Rajalaxmi), Discrete Math. Lett. 7 (2021) 74-78.   PDF
• 328. An algorithm for embedding Turán graphs into incomplete hypercubes with minimum wirelength (with A.A. Shantrinal, R.S. Rajan, T.M. Rajalaxmi), J. Graph Algorithms Appl. 25 (2021) 367-381.   PDF
• 327. Some binary products and integer linear programming for computing k-metric dimension of graphs (with F. Rahbarnia, M. Tavakoli), Appl. Math. Comput. 409 (2021) paper 126420, 7 pp.   PDF
• 326. The general position number of the Cartesian product of two trees (with J. Tian, K. Xu), Bull. Aust. Math. Soc. 104 (2021) 1-10.   PDF
• 325. The general position problem on Kneser graphs and on some graph operations (with M. Ghorbani, H.R. Maimani, M. Momeni, F. Rahimi-Mahid, G. Rus), Discuss. Math. Graph Theory 41 (2021) 1199-1213.   PDF
• 324. Maker-Breaker resolving game (with C.X. Kang, I.G. Yero, E. Yi), Bull. Malays. Math. Sci. Soc. 44 (2021) 2081-2099.   PDF
• 323. On the relation between Wiener index and eccentricity of a graph (with H. Darabi, Y. Alizadeh, K. Ch. Das), J. Comb. Optim. 41(2021) 817-829.   PDF
• 322. On general position sets in Cartesian products (with B. Patkós, G. Rus, I.G. Yero), Results Math. 76 (2021) Paper 123, 21 pp.   PDF
• 321. Transmission in H-naphtalenic nanosheet (with J.O. Sharon, T.M. Rajalaxmi, R.S. Rajan, I. Rajasingh), Appl. Math. Comput. 406 (2021) Paper 126285, 9 pp.   PDF
• 320. Perfect graphs for domination games (with Cs. Bujtás, V. Iršič), Ann. Comb. 25 (2021) 133-152.   PDF
• 319. Lower bounds for dilation, wirelength, and edge congestion of embedding graphs into hypercubes (with R.S. Rajan, T. Kalinowski, H. Mokhtar, T.M. Rajalaxmi), J. Supercomputing 77 (2021) 4135-4150.   PDF
• 318. On the difference between the eccentric connectivity index and eccentric distance sum of graphs (with Y. Alizadeh), Bull. Malays. Math. Sci. Soc. 44 (2021) 1123-1134.   PDF
• 317. On l-distance balanced product graphs (with J. Jerebic, G. Rus), Graphs Combin. 37 (2021) 369-379.   PDF
• 316. Relativistic structural characterization of molybdenum and tungsten disulfide materials (with M. Arockiaraj, S.R.J. Kavitha, S. Mushtaq, K. Balasubramanian), Int. J. Quantum Chem. (2021) 121:e26492, 24 pp.   PDF
• 315. On the general position number of complementary prisms (with P.K. Neethu, U. Chandran S.V., M. Changat), Fund. Inform. 178 (2021) 267-281.   PDF
• 314. Comparing Wiener complexity with eccentric complexity (with K. Xu, A. Ilić, V. Iršič, H. Li), Discrete Appl. Math. 290 (2021) 7-16.   PDF
• 313. Constructing new families of transmission irregular graphs (with K. Xu), Discrete Appl. Math. 289 (2021) 383-391.   PDF
• 312. 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), Discuss. Math. Graph Theory 41 (2021) 225-247.   PDF
• 311. The general position number of integer lattices (with G. Rus), Appl. Math. Comput. 390 (2021) Paper 125664, 4 pp.   PDF
• 310. Dominated and dominator colorings over (edge) corona and hierarchical products (with M. Tavakoli), Appl. Math. Comput. 390 (2021) Paper 125647, 7 pp.   PDF
• 309. On the irregularity of π-permutation graphs, Fibonacci cubes, and trees (with Y. Alizadeh, E. Deutsch), Bull. Malays. Math. Sci. Soc. 43 (2020) 4443-4456.   PDF
• 308. Comparison of Wiener index and Zagreb eccentricity indices (with K. Xu, K.Ch. Das, H. Li), MATCH Commun. Math. Comput. Chem. 84 (2020) 595-610.   PDF
• 307. On the relation between degree distance and eccentric connectivity index (with Y. Alizadeh), MATCH Commun. Math. Comput. Chem. 84 (2020) 647-659.   PDF
• 306. Z-domination game (with Cs. Bujtás, V. Iršič), Discrete Math. 343 (2020) Paper 112076, 8 pp.   PDF
• 305. A survey on packing colorings (with B. Brešar, J. Ferme, D.F. Rall), Discuss. Math. Graph Theory 40 (2020) 923-970.   PDF
• 304. S-packing chromatic vertex-critical graphs (with P. Holub, M. Jakovac), Discrete Appl. Math. 285 (2020) 119-127.   PDF
• 303. Maker-Breaker total domination game (with V. Gledel, M.A. Henning, V. Iršič), Discrete Appl. Math. 282 (2020) 96-107.   PDF
• 302. The annihilation number does not bound the 2-domination number from the above (with J. Yue, S. Zhang, Y. Zhu, Y. Shi), Discrete Math. 343 (2020) Paper 111707, 9 pp.   PDF
• 301. On the M-polynomial of planar chemical graphs (with E. Deutsch), Iranian J. Math. Chem. 11 (2020) 65-71.   PDF
• 300. Trees with distinguishing index equal distinguishing number plus one (with S. Alikhani, F. Lehner, S. Soltani), Discuss. Math. Graph Theory 40 (2020) 875-884.   PDF
• 299. Complexity of the Szeged index, edge orbits, and some nanotubical fullerenes (with Y. Alizadeh), Hacet. J. Math. Stat. 49 (2020) 87-95.   PDF
• 298. Critical graphs for the chromatic edge-stability number (with B. Brešar, N. Movarraei), Discrete Math. 343 (2020) Paper 111845, 7 pp.   PDF
• 297. On peripheral Wiener index: line graphs, Zagreb index, and cut method (with K.P. Narayankar, A.T. Kahsay), MATCH Commun. Math. Comput. Chem. 83 (2020) 129-141.   PDF
• 296. On the inverse problem for the Graovac-Pisanski index (with M. Ghorbani, S. Rahmani), MATCH Commun. Math. Comput. Chem. 83 (2020) 121-127.   PDF
• 295. Strong geodetic problem in networks (with P. Manuel, A. Xavier, A. Arokiaraj, E. Thomas), Discuss. Math. Graph Theory 40 (2020) 307-321.   PDF
• 294. Nordhaus-Gaddum and other bounds for the chromatic edge stability number (with S. Akbari, N. Movarraei, M. Nahvi), European J. Combin. 84 (2020) Paper 103042, 8 pp.   PDF
• 293. A lower bound and several exact results on the d-lucky number (with I. Rajasingh, D. Ahima Emilet), Appl. Math. Comput. 366 (2020) Paper 124760, 8 pp.   PDF
• 292. Local metric dimension of graphs: generalized hierarchical products and some applications (with M. Tavakoli), Appl. Math. Comput. 364 (2020) Paper 124676, 8 pp.   PDF
• 291. Exact distance graphs of product graphs (with B. Brešar, N. Gastineau, O. Togni), Graphs Combin. 35 (2019) 1555-1569.   PDF
• 290. Edge distance-based topological indices of strength-weighted graphs and their application to coronoid systems, carbon nanocones and SiO₂ nanostructures (with M. Arockiaraj, J. Clement, S. Mushtaq, K. Balasubramanian), Mol. Inf. 38 (2019) Paper 1900039, 16 pp.   PDF
• 289. The variety of domination games (with B. Brešar, Cs. Bujtás, T. Gologranc, G. Košmrlj, T. Marc, B. Patkós, Zs. Tuza, M. Vizer), Aequationes Math. 93 (2019) 1085-1109.   PDF
• 288. Connected domination game played on Cartesian products (with Cs. Bujtás, P. Dokyeesun, V. Iršič), Open Math. 17 (2019) 1269-1280.   PDF
• 287. The general position problem and strong resolving graphs (with I.G. Yero), Open Math. 17 (2019) 1126-1135.   PDF
• 286. A note on Frame-Stewart Conjecture (with T. Bousch, A.M. Hinz, D. Parisse, C. Petr, P.K. Stockmeyer), Discrete Math. Algorithms Appl. 11 (2019) 1950049, 4 pp.   PDF
• 285. Metric properties of generalized Sierpiński graphs over stars (with Y. Alizadeh, E. Estaji, M. Petkovšek), Discrete Appl. Math. 266 (2019) 48-55.   PDF
• 284. Topological indices of the subdivision of a family of partial cubes and computation of SiO₂ related structures (with M. Arockiaraj, S. Mushtaq, K. Balasubramanian), J. Math. Chem. 57 (2019) 1868-1883.   PDF
• 283. Strong geodetic cores and Cartesian product graphs (with V. Gledel, V. Iršič), Appl. Math. Comput. 363 (2019) Paper 124609, 10 pp.  PDF
• 282. Daisy cubes and distance cube polynomial (with M. Mollard), European J. Combin. 80 (2019) 214-223.   PDF
• 281. Maker-Breaker domination number (with V. Gledel, V. Iršič), Bull. Malays. Math. Sci. Soc. 42 (2019) 1773-1789.   PDF
• 280. Distribution of global defensive k-alliances over some graph products (with M. Tavakoli), Cent. Eur. J. Oper. Res. 27 (2019) 615-623.   PDF
• 279. Constructing uniform central graphs and embedding into them (with K.P. Narayankar, Lokesh S B), Indian J. Pure Appl. Math. 50 (2019) 451-460.   PDF
• 278. Characterization of general position sets and its applications to cographs and bipartite graphs (with B.S. Anand, U. Chandran S.V., M. Changat, E.J. Thomas), Appl. Math. Comput. 359 (2019) 84-89.   PDF
• 277. M-polynomial revisited: Bethe cacti and an extension of Gutman's approach (with E. Deutsch), J. Appl. Math. Comput. 60 (2019) 253-264.   PDF
• 276. Distance-based topological indices of nanosheets, nanotubes, and nanotori of SiO₂ (with M. Arockiaraj, S. Mushtaq, K. Balasubramanian), J. Math. Chem. 57 (2019) 343-369.   PDF
• 275. The domination game on split graphs with T. James, A. Vijayakumar), Bull. Aust. Math. Soc. 99 (2019) 327-337.   PDF
• 274. Packing chromatic vertex-critical graphs (with D.F. Rall), Discrete Math. Theor. Comput. Sci. 21(3) (2019) Paper 8, 18 pp.   PDF
• 273. Cutting lemma and union lemma for the domination game (with P. Dorbec, M.A. Henning, G. Košmrlj), Discrete Math. 342 (2019) 1213-1222.   PDF
• 272. Domination game and minimal edge cuts (with D.F. Rall), Discrete Math. 342 (2019) 951-958.   PDF
• 271. The graph theory general position problem on some interconnection networks (with P. Manuel), Fund. Inform. 163 (2018) 339-350.   PDF
• 270. Connectivity and some other properties of generalized Sierpiński graphs (with S.S. Zemljič), Appl. Anal. Discrete Math. 12 (2018) 401-412.   PDF
• 269. Game total domination critical graphs (with M. Henning, D.F. Rall), Discrete Appl. Math. 250 (2018) 28-37.   PDF
• 268. Embeddings into almost self-centered graphs of given radius (with K. Xu, H. Liu, K.Ch. Das), J. Comb. Optim. 36 (2018) 1388-1410.   PDF
• 267. Simplified constructions of almost peripheral graphs and improved embeddings into them (with K.P. Narayankar, S.P. Narayankar, D. Shubhalakshmi), Filomat 32 (2018) 1193-1198.   PDF
• 266. A general position problem in graph theory (with P. Manuel), Bull. Aust. Math. Soc. 98 (2018) 177-187.   PDF
• 265. Infinite families of circular and Möbius ladders that are total domination game critical (with M. Henning), Bull. Malays. Math. Sci. Soc. 41 (2018) 2141-2149.   PDF
• 264. On the difference between the (revised) Szeged index and the Wiener index of cacti (with S. Li, H. Zhang), Discrete Appl. Math. 247 (2018) 77-89.   PDF
• 263. General transmission lemma and Wiener complexity of triangular grids (with D. Azubha Jemilet, I. Rajasingh, P. Manuel, N. Parthiban), Appl. Math. Comput. 338 (2018) 115-122.   PDF
• 262. Strong geodetic problem in grid like architectures (with P. Manuel), Bull. Malays. Math. Sci. Soc. 41 (2018) 1671-1680.   PDF
• 261. Strong geodetic problem on Cartesian products of graphs (with V. Iršič), RAIRO Oper. Res. 52 (2018) 205-216.   PDF
• 260. Packing chromatic number versus chromatic and clique number (with B. Brešar, D.F. Rall, K. Wash), Aequationes Math. 92 (2018) 497-513.   PDF
• 259. On graphs with largest possible game domination number (with K. Xu, X. Li), Discrete Math. 341 (2018) 1768-1777.   PDF
• 258. 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.   PDF
• 257. Partition distance in graphs (with M.J. Nadjafi-Arani), J. Math. Chem. 56 (2018) 69-80.   PDF
• 256. On domination-type invariants of Fibonacci cubes and hypercubes (with J. Azarija, Y. Rho, S. Sim), Ars Math. Contemp. 14 (2018) 387-395.   PDF
• 255. Grundy dominating sequences and zero forcing sets (with B. Brešar, Cs. Bujtás, T. Gologranc, G. Košmrlj, B. Patkós, Z. Tuza, M. Vizer), Discrete Optim. 26 (2017) 66-77.  PDF
• 254. On the signed Roman k-domination: complexity and thin torus graphs (with Z. Shao, Z. Li, P. Wu, J. Xu), Discrete Appl. Math. 233 (2017) 175-186.  PDF
• 253. Strong edge geodetic problem in networks (with P. Manuel, A. Xavier, A. Arokiaraj, E. Thomas), Open Math. 15 (2017) 1225-1235.  PDF
• 252. Constructing almost peripheral and almost self-centered graphs revisited (with H. Liu, P. Singh, K. Xu), Taiwanese J. Math. 21 (2017) 705-717.  PDF
• 251. On the structure of dominating graphs (with S. Alikhani, D. Fatehi), Graphs Combin. 33 (2017) 665-672.  PDF
• 250. The 4/5 upper bound on the game total domination number (with M.A. Henning, D.F. Rall), Combinatorica 37 (2017) 223-251.  PDF
• 249. How long can one bluff in the domination game? (with B. Brešar, P. Dorbec, G. Košmrlj), Discuss. Math. Graph Theory 37 (2017) 337-352.  PDF
• 248. Packing chromatic number under local changes in a graph (with B. Brešar, D.F. Rall, K. Wash), Discrete Math. 340 (2017) 1110-1115.  PDF
• 247. (Total) domination in prisms (with J. Azarija, M.A. Henning), Electron. J. Combin. 24 (2017) Paper 1.19, 11 pp.  PDF
• 246. Packing chromatic number, (1,1,2,2)-colorings, and characterizing the Petersen graph (with B. Brešar, D.F. Rall, K. Wash), Aequationes Math. 91 (2017) 169-184.  PDF
• 245. Graphs that are simultaneously efficient open domination and efficient closed domination graphs (with I. Peterin, I.G. Yero), Discrete Appl. Math. 217 (2017) 613-621.  PDF
• 244. A survey and classification of Sierpiński-type graphs (with A.M. Hinz, S.S. Zemljič), Discrete Appl. Math. 217 (2017) 565-600.  PDF
• 243. Average distance in interconnection networks via reduction theorems for vertex-weighted graphs (with P. Manuel, M.J. Nadjafi-Arani, R. Sundara Rajan, C. Grigorious, S. Stephen), Comput. J. 59 (2016) 1900-1910.   PDF
• 242. Dominating sequences in grid-like and toroidal graphs (with B. Brešar, Cs. Bujtás, T. Gologranc, G. Košmrlj, B. Patkós, Z. Tuza, M. Vizer), Electron. J. Combin. 23 (2016) Paper 4.34, 19 pp.  PDF
• 241. Edge-transitive lexicographic and Cartesian products (with W. Imrich, A. Iranmanesh, A. Soltani), Discuss. Math. Graph Theory 36 (2016) 857-865.  PDF
• 240. Complexity of the game domination problem (with B. Brešar, P. Dorbec, G. Košmrlj, G. Renault), Theoret. Comput. Sci. 648 (2016) 1-7.  PDF
• 239. Complexity of topological indices: The case of connective eccentric index (with Y. Alizadeh), MATCH Commun. Math. Comput. Chem. 76 (2016) 659-667.  PDF
• 238. Packing chromatic number of base-3 Sierpiński graphs (with B. Brešar, D.F. Rall), Graphs Combin. 32 (2016) 1313-1327.  PDF
• 237. Vertex and edge orbits of Fibonacci and Lucas cubes (with A.R. Ashrafi, J. Azarija, K. Fathalikhani, M. Petkovšek), Ann. Comb. 20 (2016) 209-229.  PDF
• 236. On graphs with small game domination number (with G. Košmrlj, S. Schmidt), Appl. Anal. Discrete Math. 10 (2016) 30-45.  PDF
• 235. Edge-transitive products (with R. Hammack, W. Imrich), J. Algebraic Combin. 43 (2016) 837-850.  PDF
• 234. Improved upper bounds on the domination number of graphs with minimum degree at least five (with Cs. Bujtás), Graphs Combin. 32 (2016) 511-519.  PDF
• 233. The (non-)existence of perfect codes in Fibonacci cubes (with A.R. Ashrafi, J. Azarija, A. Babai, K. Fathalikhani), Inform. Process. Lett. 116 (2016) 387-390.  PDF
• 232. Labeling dot-Cartesian and dot-lexicographic product graphs with a condition at distance two (with Z. Shao, I. Averbakh), Comput. J. 59 (2016) 151-158.  PDF
• 231. Modified Wiener index via canonical metric representation, and some fullerene patches (with M. Ghorbani), Ars Math. Contemp. 11 (2016) 247-254.  PDF
• 230. On isomorphism classes of generalized Fibonacci cubes (with J. Azarija, J. Lee, J. Pantone, Y. Rho), European J. Combin. 51 (2016) 372-379.  PDF
• 229. On the computational complexity of the domination game (with G. Košmrlj, S. Schmidt), Iran. J. Math. Sci. Inform. 10(2) (2015) 115-122.  PDF
• 228. Domination game critical graphs (with Cs. Bujtás, G. Košmrlj), Discuss. Math. Graph Theory 35 (2015) 781-796.  PDF
• 227. The edge-Wiener index of benzenoid systems in linear time (with A. Kelenc, N. Tratnik), MATCH Commun. Math. Comput. Chem. 74 (2015) 529-540.  PDF
• 226. M-polynomial and degree-based topological indices (with E. Deutsch), Iranian J. Math. Chem. 6 (2015) 93-102.  PDF
• 225. Total version of the domination game (with M.A. Henning, D.F. Rall), Graphs Combin. 31 (2015) 1453-1462.  PDF
• 224. Moore graphs and cycles are extremal graphs for convex cycles (with J. Azarija), J. Graph Theory 80 (2015) 34-42.  PDF
• 223. Weighted Harary indices of apex trees and k-apex trees (with K. Xu, J. Wang, K.Ch. Das), Discrete Appl. Math. 189 (2015) 30-40.  PDF
• 222. On the Wiener index of generalized Fibonacci cubes and Lucas cubes (with Y. Rho), Discrete Appl. Math. 187 (2015) 155-160.  PDF
• 221. Cut method: update on recent developments and equivalence of independent approaches (with M.J. Nadjafi-Arani), Curr. Org. Chem. 19 (2015) 348-358.  PDF
• 220. Guarded subgraphs and the domination game (with B. Brešar, G. Košmrlj, D.F. Rall), Discrete Math. Theor. Comput. Sci. 17 (2015) 161-168.  PDF
• 219. Local colorings of Cartesian product graphs (with Z. Shao), Int. J. Comput. Math. 92 (2015) 694-699.  PDF
• 218. Connectivity of Fibonacci cubes, Lucas cubes, and generalized cubes (with J. Azarija, J. Lee, Y. Rho), Discrete Math. Theor. Comput. Sci. 17(1) (2015) 79-88.  PDF
• 217. Generalized power domination: propagation radius and Sierpiński graphs (with P. Dorbec), Acta Appl. Math. 134 (2014) 75-86.  PDF
• 216. Extremal (n,m)-graphs with respect to distance-degree-based topological indices (with K. Xu, K.Ch. Das, J. Wang), MATCH Commun. Math. Comput. Chem. 72 (2014) 865-880.  PDF
• 215. Asymptotic properties of Fibonacci cubes and Lucas cubes (with M. Mollard), Ann. Comb. 18 (2014) 447-457.  PDF
• 214. Average distance, surface area, and other structural properties of exchanged hypercubes (with M. Ma), J. Supercomput. 69 (2014) 306-317.  PDF
• 213. On the difference between the revised Szeged index and the Wiener index (with M.J. Nadjafi-Arani), Discrete Math. 333 (2014) 28-34.  PDF
• 212. Domination game: effect of edge- and vertex-removal (with B. Brešar, P. Dorbec, G. Košmrlj), Discrete Math. 330 (2014) 1-10.  PDF
• 211. Wiener dimension: fundamental properties and (5,0)-nanotubical fullerenes (with Y. Alizadeh, V. Andova, R. Škrekovski), MATCH Commun. Math. Comput. Chem. 72 (2014) 279-294.  PDF
• 210. Fibonacci (p,r)-cubes as Cartesian products (with Y. Rho), Discrete Math. 328 (2014) 23-26.  PDF
• 209. Equal opportunity networks, distance-balanced graphs, and Wiener game (with K. Balakrishnan, B. Brešar, M. Changat, A. Vesel, P. Žigert), Discrete Optim. 12 (2014) 150-154.  PDF
• 208. Almost-peripheral graphs (with Kishori P. Narayankar, H.B. Walikar, Lokesh S.B.), Taiwanese J. Math. 18 (2014) 463-471.  PDF
• 207. Computing distance moments on graphs with transitive Djoković-Winkler's relation (with M.J. Nadjafi-Arani), Discrete Appl. Math. 166 (2014) 269-272.  PDF
• 206. Improved bounds on the difference between the Szeged index and the Wiener index of graphs (with M.J. Nadjafi-Arani), European J. Combin. 39 (2014) 148-156.  PDF
• 205. The domination number of exchanged hypercubes (with M. Ma), Inform. Process. Lett. 114 (2014) 159-162.  PDF
• 204. Wiener index in weighted graphs via unification of Θ*-classes (with M.J. Nadjafi-Arani), European J. Combin. 36 (2014) 71-76.  PDF
• 203. Computing Hosoya polynomials of graphs from primary subgraphs (with E. Deutsch), MATCH Commun. Math. Comput. Chem. 70 (2013) 627-644.  PDF
• 202. Stable traces as a model for self-assembly of polypeptide nanoscale polyhedrons (with J. Rus), MATCH Commun. Math. Comput. Chem. 70 (2013) 317-330.  PDF
• 201. Design of a single-chain polypeptide tetrahedron assembled from coiled-coil segments (with H. Gradišar et al.), Nature Chemical Biology 9 (2013) 362-366.
• 200. Domination game: extremal families of graphs for the 3/5-conjectures (with B. Brešar, G. Košmrlj, D.F. Rall), Discrete Appl. Math. 161 (2013) 1308-1316.  PDF
• 199. Structure of Fibonacci cubes: a survey, J. Comb. Optim. 25 (2013) 505-522.  PDF
• 198. Sierpiński graphs as spanning subgraphs of Hanoi graphs (with A.M. Hinz, S.S. Zemljič), Cent. Eur. J. Math. 11 (2013) 1153-1157.  PDF
• 197. Wiener index versus Szeged index in networks (with M.J. Nadjafi-Arani), Discrete Appl. Math. 161 (2013) 1150-1153.  PDF
• 196. Interpolation method and topological indices: 2-parametric families of graphs (with Y. Alizadeh), MATCH Commun. Math. Comput. Chem. 69 (2013) 523-534.  PDF
• 195. On distances in Sierpiński graphs: almost-extreme vertices and metric dimension (with S.S. Zemljič), Appl. Anal. Discrete Math. 7 (2013) 72-82.   PDF
• 194. Domination game played on trees and spanning subgraphs (with B. Brešar, D.F. Rall), Discrete Math. 313 (2013) 915-923.  PDF
• 193. Hamming dimension of a graph - the case of Sierpiński graphs (with I. Peterin, S.S. Zemljič), European J. Combin. 34 (2013) 460-473.  PDF
• 192. On the rainbow connection of Cartesian products and their subgraphs (with G. Mekiš), Discuss. Math. Graph Theory 32 (2012) 783-793.  PDF
• 191. Parity index of binary words and powers of prime words (with A. Ilić, Y. Rho), Electron. J. Combin. 19 (2012) Paper 44, 11 pp.  PDF
• 190. Almost self-centered median and chordal graphs (with K. Balakrishnan, B. Brešar, M. Changat, I. Peterin, A.R. Subhamathi), Taiwanese J. Math. 16 (2012) 1911-1922.  PDF
• 189. The index of a binary word (with A. Ilić, Y. Rho), Theoret. Comput. Sci. 452 (2012) 100-106.  PDF
• 188. Generalized Lucas cubes (with A. Ilić and Y. Rho), Appl. Anal. Discrete Math. 6 (2012) 82-94.  PDF
• 187. Convex excess in partial cubes (with S. Shpectorov), J. Graph Theory 69 (2012) 356-369.  PDF
• 186. Characterization of 1-cycle resonant graphs among bipartite 2-connected plane graphs (K. Salem), Discrete Appl. Math. 160 (2012) 1277-1280.  PDF
• 185. Interpolation method and topological indices: the case of fullerenes C12k+4 (with Y. Alizadeh, A. Iranmanesh), MATCH Commun. Math. Comput. Chem. 68 (2012) 303-310.  PDF
• 184. Wiener index and Hosoya polynomial of Fibonacci and Lucas cubes (with M. Mollard), MATCH Commun. Math. Comput. Chem. 68 (2012) 311-324.  PDF
• 183. Cube polynomial of Fibonacci and Lucas cubes (with M. Mollard), Acta Appl. Math. 117 (2012) 93-105.  PDF
• 182. Convex sets in lexicographic products of graphs (with B.S. Anand, M. Changat, I. Peterin), Graphs Combin. 28 (2012) 77-84.  PDF
• 181. Vizing's conjecture: a survey and recent results (with B. Brešar, P. Dorbec, W. Goddard, B.L. Hartnell, M.A. Henning, D.F. Rall), J. Graph Theory 69 (2012) 46-76.  PDF
• 180. Characterizing almost-median graphs II (with S. Shpectorov), Discrete Math. 312 (2012) 462-464.  PDF
• 179. Generalized Fibonacci cubes (with A. Ilić, Y. Rho), Discrete Math. 312 (2012) 2-11.  PDF
• 178. Asymptotic number of isometric generalized Fibonacci cubes (with S. Shpectorov), European J. Combin. 33 (2012) 220-226.  PDF
• 177. Almost self-centered graphs (with Kishori P. Narayankar, H.B. Walikar), Acta Math. Sin. (Engl. Ser.) 27 (2011) 2343-2350.  PDF
• 176. Computing quadratic entropy in evolutionary trees (with D. Bokal, M. DeVos, A. Mimoto, A.O. Mooers), Comput. Math. Appl. 62 (2011) 3821-3828.  PDF
• 175. On idomatic partitions of direct products of complete graphs (with G. Mekiš), Graphs Combin. 27 (2011) 713-726.  PDF
• 174. Two-ended regular median graphs (with W. Imrich), Discrete Math. 311 (2011) 1418-1422.  PDF
• 173. On the domination number and the 2-packing number of Fibonacci cubes and Lucas cubes (with A. Castro, M. Mollard, Y. Rho), Comput. Math. Appl. 61 (2011) 2655-2660.  PDF
• 172. The degree sequence of Fibonacci and Lucas cubes (with M. Mollard, M. Petkovšek), Discrete Math. 311 (2011) 1310-1322.  PDF
• 171. The Fibonacci dimension of a graph (with S. Cabello, D. Eppstein), Electron. J. Combin. 18 (2011) Paper 55, 23 pp.  PDF
• 170. Tensor 2-sums and entanglement (with S. Severini), J. Phys. A: Math. Theor. 43 (2010) 212001, 8pp.  PDF
• 169. Domination game and an imagination strategy (with B. Brešar, D.F. Rall), SIAM J. Discrete Math. 24 (2010) 979-991.  PDF
• 168. Simultaneous embeddings of graphs as median and antimedian subgraphs (with K. Balakrishnan, B. Brešar, M. Changat, M. Kovše, A. Subhamathi), Networks 56 (2010) 90-94.  PDF
• 167. Calculating the degree distance of partial Hamming graphs (with A. Ilić, D. Stevanović), MATCH Commun. Math. Comput. Chem. 63 (2010) 411-424.  PDF
• 166. On distance-balanced graphs (with A. Ilić, M. Milanović), European J. Combin. 31 (2010) 733-737.  PDF
• 165. Maximum cardinality resonant sets and maximal alternating sets of hexagonal systems (with K. Salem, A. Taranenko), Comp. Math. Appl. 59 (2010) 506-513.  PDF
• 164. The b-chromatic number of cubic graphs (with M. Jakovac), Graphs Combin. 26 (2010) 107-118.  PDF
• 163. Covering codes in Sierpiński graphs (with L. Beaudou, S. Gravier, M. Kovše, M. Mollard), Discrete Math. Theor. Comput. Sci. 12(3) (2010) 63-74.  PDF
• 162. The distinguishing chromatic number of Cartesian products of two complete graphs (with J. Jerebic), Discrete Math. 310 (2010) 1715-1720.  PDF
• 161. Recent developments on the structure of Cartesian products of graphs, Ramanujan Mathematical Society Lecture Notes Series 13 (2010) 171-177.  PDF
• 160. Computing median and antimedian sets in median graphs (with K. Balakrishnan, B. Brešar, M. Changat, M. Kovše, A.R. Subhamathi), Algorithmica 57 (2010) 207-216.  PDF
• 159. Cluj and related polynomials in tori (with M.V. Diudea, C.L. Nagy, P. Žigert), Stud. Univ. Babeş-Bolyai Chem. 55 (2010) 113-123.  PDF
• 158. Omega polynomial revisited (with M.V. Diudea), Acta Chim. Slov. 57 (2010) 565-570.  PDF
• 157. The packing chromatic number of infinite product graphs (with J. Fiala and B. Lidicky), European J. Combin. 30 (2009) 1101-1113.  PDF
• 156. On semicube graphs (with M. Kovše), European J. Combin. 30 (2009) 5-10.  PDF
• 155. On even and harmonic-even partial cubes (with M. Kovše), Ars Combin. 93 (2009) 77-86.  PDF
• 154. The Clar formulas of a benzenoid system and the resonance graph (with K. Salem, A. Vesel, P. Žigert), Discrete Appl. Math. 157 (2009) 2565-2569.  PDF
• 153. Vertex-, edge-, and total-colorings of Sierpiński-like graphs (with M. Jakovac), Discrete Math. 309 (2009) 1548-1556.  PDF
• 152. Transitive, locally finite median graphs with finite blocks (with W. Imrich), Graphs Combin. 25 (2009) 81-90.  PDF
• 151. On the remoteness function in median graphs (with K. Balakrishnan, B. Brešar, M. Changat, W. Imrich, M. Kovše, A. Subhamathi), Discrete Appl. Math. 157 (2009) 3679-3688.  PDF
• 150. Induced cycles in crossing graphs of median graphs (with M. Kovše), Discrete Math. 309 (2009) 6585-6589.  PDF
• 149. Characterizing posets for which their natural transit functions coincide (with B. Brešar, M. Changat, J. Mathews, A. Mathews, Prasanth G.N.), Ars Math. Contemp. 2 (2009) 27-33.  PDF
• 148. Cover-incomparability graphs of posets (with B. Brešar, M. Changat, M. Kovše, J. Mathews, A. Mathews), Order 25 (2008) 335-347.  PDF
• 147. The median function on graphs with bounded profiles (with K. Balakrishnan, M. Changat), Discrete Appl. Math. 156 (2008) 2882-2889.  PDF
• 146. Distance-balanced graphs (with J. Jerebic, D.F. Rall), Ann. Combin. 12 (2008) 71-79.  PDF
• 145. Antimedian graphs (with K. Balakrishnan, M. Changat, J. Mathews, I. Peterin, Prasanth G.N., S. Špacapan), Australas. J. Combin. 41 (2008) 159-170.  PDF
• 144. Improved bounds on the L(2,1)-number of direct and strong products of graphs (with Z. Shao, D. Zhang), IEEE Trans. Circuits and Systems II: Express Briefs 55 (2008) 685-689.  PDF
• 143. The distinguishing number of Cartesian products of complete graphs (with W. Imrich, J. Jerebic), European J. Combin. 29 (2008) 922-929.  PDF
• 142. Coloring Sierpinski graphs and Sierpinski gasket graphs, Taiwan. J. Math. 12 (2008) 513-522.  PDF
• 141. A bird's eye view of the cut method and a survey of its applications in chemical graph theory, MATCH Commun. Math. Comput. Chem. 60 (2008) 255-274.  PDF
• 140. Some comments on co graphs and CI index, MATCH Commun. Math. Comput. Chem. 59 (2008) 217-222.  PDF
• 139. On the edge-connectivity of Cartesian product graphs (with S. Špacapan), Asian-European J. Math. 1 (2008) 93-98.  PDF
• 138. On the geodetic number and related metric sets in Cartesian product graphs (with B. Brešar, A. Tepeh Horvat), Discrete Math. 308 (2008) 5555-5561.  PDF
• 137. Power domination in product graphs (with P. Dorbec, M. Mollard, S. Špacapan), SIAM J. Discrete Math. 22 (2008) 554-567.  PDF
• 136. Cancellation properties of products of graphs (with W. Imrich, D.F. Rall), Discrete Appl. Math. 155 (2007) 2362-2364.  PDF  
• 135. Edge-counting vectors, Fibonacci cubes, and Fibonacci triangle (with I. Peterin), Publ. Math. Debrecen 71 (2007) 267-278.  PDF  
• 134. Strong isometric dimension, biclique coverings, and Sperner's Theorem (with D. Fronček, J. Jerebic, P. Kovář), Comb. Prob. Comp. 16 (2007) 271-275.  PDF  
• 133. Dominating direct products of graphs (with B. Brešar, D. Rall), Discrete Math. 307 (2007) 1636-1642.  PDF  
• 132. Tribes of cubic partial cubes (with S. Shpectorov), Discrete Math. Theor. Comput. Sci. 9 (2007) 273-292.  PDF  
• 131. On Θ-graphs of partial cubes (with M. Kovše), Discuss. Math. Graph Theory 27 (2007) 313-321.  PDF  
• 130. Partial cubes and their τ-graphs (with M. Kovše), European J. Combin. 28 (2007) 1037-1042.  PDF  
• 129. Crossing graphs as joins of graphs and Cartesian products of median graphs (with B. Brešar), SIAM J. Discrete Math. 21 (2007) 26-32.  PDF  
• 128. On plane bipartite graphs without fixed edges (with K. Salem), Appl. Math. Lett. 20 (2007) 813-816.  PDF  
• 127. On the PI index: PI-partitions and Cartesian product graphs, MATCH Commun. Math. Comput. Chem. 57 (2007) 573-586.  PDF  
• 126. Distinguishing infinite graphs (with W. Imrich, V. Trofimov), Electron. J. Combin. 14 (2007) #R36  PDF  
• 125. On the packing chromatic number of Cartesian products, hexagonal lattice, and trees (with B. Brešar, D.F. Rall), Discrete Appl. Math. 155 (2007) 2303-2311.  PDF  
• 124. Stern polynomials (with U. Milutinović, C. Petr), Adv. Appl. Math. 39 (2007) 86-95.  PDF  
• 123. Cartesian powers of graphs can be distinguished with two labels (with X. Zhu), European J. Combin. 28 (2007) 303-310.  PDF  
• 122. Nonrepetitive colorings of trees (with B. Brešar, J. Grytczuk, S. Niwczyk, I. Peterin), Discrete Math. 307 (2007) 163-172.  PDF  
• 121. On cube-free median graphs (with B. Brešar, R. Škrekovski), Discrete Math. 307 (2007) 345-351.  PDF  
• 120. Maximal proper subgraphs of median graphs (with B. Brešar), Discrete Math. 307 (2007) 1389-1394.  PDF  
• 119. Hamming polynomials and their partial derivatives (with B. Brešar, P. Dorbec, M. Mollard), European J. Combin. 28 (2007) 1156-1162.  PDF  
• 118. On the canonical metric representation, average distance, and partial Hamming graphs, European J. Combin. 27 (2006) 68-73.   PDF  
• 117. Distinguishing Cartesian powers of graphs (with W. Imrich), J. Graph Theory 55 (2006) 250-260.  PDF  
• 116. Distinguishing labelings of group action on vector spaces and graphs (with X. Zhu, T.-L. Wong), J. Algebra 303 (2006) 626-641.  PDF  
• 115. The ∆²-conjecture for L(2,1)-labelings is true for direct and strong products of graphs (with S. Špacapan), IEEE Trans. Circuits and Systems II 53 (2006) 274-277.  PDF  
• 114. The lattice dimension of benzenoid systems (with M. Kovše), MATCH Commun. Math. Comput. Chem. 56 (2006) 637-648.  PDF  
• 113. A theorem on Wiener-type invariants for isometric subgraphs of hypercubes (with I. Gutman), Appl. Math. Lett. 19 (2006) 1129-1133.  PDF  
• 112. On the role of hypercubes in the resonance graphs of benzenoid graphs (with I. Gutman, K. Salem), Discrete Math. 306 (2006) 699-704.  PDF  
• 111. Chemical graph theory of fibonacenes (with I. Gutman), MATCH Commun. Math. Comput. Chem. 55 (2006) 39-54.  PDF  
• 110. Θ-graceful labelings of partial cubes (with B. Brešar), Discrete Math. 306 (2006) 1264-1271.  PDF  
• 109. On integer domination in graphs and Vizing-like problems (with B. Brešar, M.A. Henning), Taiwan. J. Math. 10 (2006) 1317-1328.  PDF  
• 108. On induced and isometric embeddings of graphs into the strong product of paths (with J. Jerebic), Discrete Math. 306 (2006) 1358-1363.  PDF  
• 107. An almost complete description of perfect codes in direct products of cycles (with S. Špacapan, J. Žerovnik), Adv. in Appl. Math. 37 (2006) 2-18.  PDF  
• 106. Some results on total domination in direct products of graphs (with P. Dorbec, S. Gravier, S. Špacapan), Discuss. Math. Graph Theory 26 (2006) 103-112.  PDF  
• 105. Counting hypercubes in hypercubes, Discrete Math. 306 (2006) 2964-2967.  PDF  
• 104. Roots of cube polynomials of median graphs (with B. Brešar, R. Škrekovski), J. Graph Theory 52 (2006) 37-50.  PDF  
• 103. On median nature and enumerative properties of Fibonacci-like cubes, Discrete Math. 299 (2005) 145-153.  PDF  
• 102. Median and quasi-median direct products of graphs (with B. Brešar, P.K. Jha, B. Zmazek), Discuss. Math. Graph Theory 25 (2005) 183-196.  PDF  
• 101. Crossing numbers of Sierpinski-like graphs (with B. Mohar), J. Graph Theory 50 (2005) 186-198.  PDF  
• 100. Metric properties of the Tower of Hanoi graphs and Stern's diatomic sequence (with A.M. Hinz, U. Milutinović, D. Parisse, C. Petr), European J. Combin. 26 (2005) 693-708.  PDF  
• 99. Hanoi graphs and some classical numbers (with U. Milutinović, C. Petr), Expo. Math. 23 (2005) 371-378.  PDF  
• 98. Reconstructing subgraph-counting graph polynomials of increasing families of graphs (with B. Brešar, W. Imrich), Discrete Math. 297 (2005) 159-166.  PDF  
• 97. Characterizing r-perfect codes in direct products of two and three cycles (with J. Jerebic, S. Špacapan), Inform. Process. Lett. 94 (2005) 1-6.  PDF  
• 96. Hypercubes as direct products (with B. Brešar, W. Imrich, B. Zmazek), SIAM J. Discrete Math. 18 (2005) 778-786.  PDF  
• 95. Characterizing subgraphs of Hamming graphs (with I. Peterin), J. Graph Theory 49 (2005) 302-312.  PDF  
• 94. Some new bounds and exact results on the independence number of Cartesian product graphs, Ars Combin. 74 (2005) 173-186.  PDF  
• 93. Fibonacci cubes are the resonance graphs of fibonaccenes (with P. Žigert), Fibonacci Quart. 43 (2005) 269-276.  PDF  
• 92. Wiener index under gated amalgamations, MATCH Commun. Math. Comput. Chem. 53 (2005) 181-194.  PDF  
• 91. Codes and L(2,1)-labelings in Sierpinski graphs (with S. Gravier, M. Mollard), Taiwanese J. Math. 9 (2005) 671-681.  PDF  
• 90. Optimal L(d,1)-labelings of certain direct products of cycles and Cartesian products of cycles (with P.K. Jha, A. Vesel), Discrete Appl. Math. 152 (2005) 257-265.  PDF  
• 89. L(2,1)-labeling of direct product of paths and cycles (with P.K. Jha, A. Vesel), Discrete Appl. Math. 145 (2005) 317-325.  PDF  
• 88. Square-free colorings of graphs (with B. Brešar), Ars Combin. 70 (2004) 3-13.  PDF  
• 87. Wiener-type invariants of trees and their relation (with I. Gutman, A.A. Dobrynin, L. Pavlović), Bull. Inst. Comb. Appl. 40 (2004) 23-30.  PDF  
• 86. Cubic inflation, mirror graphs, regular maps and partial cubes (with B. Brešar, A. Lipovec, B. Mohar), European J. Combin. 25 (2004) 55-64.  PDF  
• 85. Edge-critical isometric subgraphs of hypercubes (with A. Lipovec), Ars Combin. 70 (2004) 139-147.  PDF  
• 84. On resonance graphs of catacondensed hexagonal graphs: structure, coding, and hamilton path algorithm (with A. Vesel, P. Žigert), MATCH Commun. Math. Comput. Chem. 49 (2003) 99-116.  PDF  
• 83. Relation between Wiener-type topological indices of benzenoid molecules (with I. Gutman), Chem. Phys. Lett. 373 (2003) 328-332.  PDF  
• 82. Computing graph invariants on rotagraphs using dynamic algorithm approach: The case of (2,1)-colorings and independence numbers (with A. Vesel), Discrete Appl. Math. 129 (2003) 449-460.  PDF  
• 81. The cube polynomial and its derivatives: the case of median graphs (with B. Brešar, R. Škrekovski), Electron. J. Combin. 10 (2003) #R3, 11pp.  PDF  
• 80. Quasi-median graphs, their generalizations, and tree-like equalities (with B. Brešar, R. Škrekovski), European J. Combin. 24 (2003) 557-572.  PDF  
• 79. Tree-like isometric subgraphs of hypercubes (with B. Brešar, W. Imrich), Discuss. Math. Graph Theory 23 (2003) 227-240.  PDF  
• 78. Isometric embeddings of subdivided wheels in hypercubes (with S. Gravier, M. Mollard), Discrete Math. 269 (2003) 287-293.  PDF  
• 77. Fast recognition algorithms for classes of partial cubes (with B. Brešar, W. Imrich), Discrete Appl. Math. 131 (2003) 51-61.  PDF  
• 76. On cubic and edge-critical isometric subgraphs of hypercubes, Australas. J. Combin. 28 (2003) 217-224 (with C.P. Bonnington, A. Lipovec).  PDF  
• 75. Partial cubes as subdivision graphs and as generalized Petersen graphs (with A. Lipovec), Discrete Math. 263 (2003) 157-165.  PDF  
• 74. On partial cubes and graphs with convex intervals (with B. Brešar), Comment. Math. Univ. Carolinae 43 (2002) 537-545.  PDF  
• 73. Tiled partial cubes (with B. Brešar, W. Imrich, H.M. Mulder, R.Škrekovski), J. Graph Theory 40 (2002) 91-103.  PDF  
• 72. Partial cubes and crossing graphs (with H.M. Mulder), SIAM J. Discrete Math. 15 (2002) 235-251.  PDF  
• 71. On the fractional chromatic number, the chromatic number, and graph products (with H.-G. Yeh), Discrete Math. 247 (2002) 235-242.  PDF  
• 70. On subgraphs of Cartesian product graphs (with A. Lipovec, M. Petkovšek), Discrete Math. 244 (2002) 223-230.   PDF  
• 69. Resonance graphs of catacondensed even ring systems are median (with P. Žigert, G. Brinkmann), Discrete Math. 253 (2002) 35-43.  PDF  
• 68. Wiener index of hexagonal systems (with A.A. Dobrynin, I. Gutman, P. Žigert), Acta Appl. Math. 72 (2002) 247-294.  PDF  
• 67. Clar number of catacondensed benzenoid hydrocarbons (with P. Žigert, I. Gutman), J. Mol. Struct. THEOCHEM 586 (2002) 235-240.  PDF  
• 66. Three methods for calculation of the hyper-Wiener index of molecular graphs (with G. Cash, M. Petkovšek), J. Chem. Inf. Comput. Sci. 42 (2002) 571-576.  PDF  
• 65. A min-max result on catacondensed benzenoid graphs (with P. Žigert), Appl. Math. Lett. 15 (2002) 279-283.  PDF  
• 64. Simple explicit formulas for the Frame-Stewart numbers (with U. Milutinović), Ann. Combin. 6 (2002) 157-167.  PDF  
• 63. 1-perfect codes in Sierpinski graphs (with U. Milutinović, C. Petr), Bull. Austral. Math. Soc. 66 (2002) 369-384.  PDF  
• 62. On the Frame-Stewart algorithm for the multi-peg tower of Hanoi problem (with U. Milutinović, C. Petr), Discrete Appl. Math. 120 (2002) 141-157.  PDF  
• 61. Combinatorics of topmost discs of multi-peg Tower of Hanoi problem (with U. Milutinović, C. Petr), Ars. Combin. 59 (2001) 55-64.  PDF  
• 60. The all-paths transit function of a graph (with M. Changat, H.M. Mulder), Czech. Math. J. 51 (2001) 439-448.  PDF  
• 59. Binary coding of Kekule structures of catacondensed benzenoid hydrocarbons (with A. Vesel, I. Gutman), Comput. Chem. 25 (2001) 569-575.  PDF  
• 58. On Hosoya polynomials of benzenoid graphs (with I. Gutman, M. Petkovšek), MATCH Commun. Math. Comput. Chem. 43 (2001) 49-66.  PDF  
• 57. On median graphs and median grid graphs (with R. Škrekovski), Discrete Math. 219 (2000) 287-293.  PDF  
• 56. Average distances in square-cell configurations (with I. Gutman, A. Rajapakse), Int. J. Quant. Chem. 76 (2000) 611-617.  PDF  
• 55. Applications of isometric embeddings to chemical graphs, DIMACS Ser. Discrete Math. Theo. Comput. Sci. 51 (2000) 249-256.  PDF  
• 54. Square-edge graphs (with R. Škrekovski, A. Vesel), Bull. Inst. Comb. Appl. 30 (2000) 67-78.  PDF  
• 53. Calculating the hyper-Wiener index of benzenoid hydrocarbons (with P. Žigert, I. Gutman), Models Chem. 137 (2000) 83-94.  PDF  
• 52. An algorithm for the calculation of the hyper-Wiener index of benzenoid hydrocarbons (with P. Žigert, I. Gutman), Comput. Chem. 24 (2000) 229-233.  PDF  
• 51. Graphs which locally mirror the hypercube structure (with J. Koolen, H.M. Mulder), Inform. Proc. Lett. 71 (1999) 87-90.  PDF  
• 50. Recognizing graphs of acyclic cubical complexes (with W. Imrich), Discrete Appl. Math. 95 (1999) 321-330.  PDF  
• 49. Median graphs: characterizations, location theory and related structures(with H.M. Mulder), J. Combin. Math. Combin. Comput. 30 (1999) 103-127.  PDF  
• 48. Median graphs and triangle-free graphs (with W. Imrich, H.M. Mulder), SIAM J. Discrete Math. 12 (1999) 111-118.  PDF  
• 47. Recognizing median graphs in subquadratic time (with J. Hagauer, W. Imrich), Theoret. Comput. Sci. 215 (1999) 123-136.  PDF  
• 46. On analog signature analysis (with F. Novak, B. Hvala), (D. Borrione, R. Ernst, eds.) Design, automation and test in Europe, (1999) 249-253, IEEE Computer Society, Los Alamos. PDF  
• 45. A convexity lemma and expansion procedures for bipartite graphs (with W. Imrich), European J. Combin. 19 (1998) 677-685.  PDF  
• 44. An Euler-type formula for median graphs (with H.M. Mulder, R. Škrekovski), Discrete Math. 187 (1998) 255-258.  PDF  
• 43. Independence in direct-product graphs (with P.K. Jha), Ars Combin. 50 (1998) 53-63.   PDF  
• 42. A characterization of halved cubes (with W. Imrich, A. Vesel), Ars Combin. 48 (1998) 27-32.  PDF  
• 41. Distances in benzenoid systems: further developments (with V. Chepoi), Discrete Math. 192 (1998) 27-39.  PDF  
• 40. Relations between Wiener numbers of benzenoid hydrocarbons and phenylenes (with I. Gutman), Models Chem. 135 (1998) 45-55.  PDF  
• 39. On the fractional chromatic number and the lexicographic product of graphs, Discrete Math. 185 (1998) 259-263.  PDF  
• 38. Distributed multicast routing in point-to-point networks (with J. Rugelj), Comp. Oper. Res. 24 (1997) 521-527.  PDF  
• 37. On Y-compatible and strict Y-compatible functions (with B. Hvala, F. Novak), Appl. Math. Lett. 10 (1997) 79-82.  PDF  
• 36. Isomorphic components of Kronecker product of bipartite graphs (with P.K. Jha, B. Zmazek), Discuss. Math. Graph Theory 17 (1997) 301-309.   PDF  
• 35. Wiener numbers of pericondensed benzenoid hydrocarbons (with I. Gutman, A. Rajapakse), Croat. Chem. Acta 70 (1997) 979-999.  PDF  
• 34. Wiener number of vertex-weighted graphs and a chemical application (with I. Gutman), Discrete Appl. Math. 80 (1997) 73-81.  PDF  
• 33. The Wiener index and the Szeged index of benzenoid systems in linear time (with V. Chepoi), J. Chem. Inf. Comput. Sci. 37 (1997) 752-755.  PDF  
• 32. Bounds for the Schultz molecular topological index of benzenoid systems in terms of the Wiener index (with I. Gutman), J. Chem. Inf. Comput. Sci. 37 (1997) 741-744.  PDF  
• 31. Recognizing Hamming graphs in linear time and space (with W. Imrich), Inform. Proc. Lett. 63 (1997) 91-95.  PDF  
• 30. Graphs S(n,k) and a variant of the Tower of Hanoi problem (with U. Milutinović), Czech. Math. J. 47 (1997) 95-104.  PDF  
• 29. On the complexity of recognizing Hamming graphs and related classes of graphs (with W. Imrich), European J. Combin. 17 (1996) 209-221.  PDF  
• 28. Clique-gated graphs (with J. Hagauer), Discrete Math. 161 (1996) 143-149.  PDF  
• 27. Coloring graph products - a survey, Discrete Math. 155 (1996) 135-145.  PDF  
• 26. A method for calculating Wiener numbers of benzenoid hydrocarbons (with I. Gutman), Models Chem. 133 (1996) 389-399.  PDF  
• 25. A comparison of the Schultz molecular topological index and the Wiener index (with I. Gutman), J. Chem. Inf. Comput. Sci. 36 (1996) 1001-1003.  PDF  
• 24. The Szeged and the Wiener index of graphs (with I. Gutman, A. Rajapakse), Appl. Math. Lett. 9 (1996) 45-49.  PDF  
• 23. On a Vizing-like conjecture for direct product graphs (with B. Zmazek), Discrete Math. 156 (1996) 243-246.   PDF  
• 22. On independence numbers of the Cartesian product of graphs (with J. Hagauer), Ars Combin. 43 (1996) 149-157.  PDF  
• 21. Algebraic approach to fasciagraph and rotagraphs (with J. Žerovnik), Discrete Appl. Math. 68 (1996) 93-100.  PDF  
• 20. Dominating Cartesian products of cycles (with N. Seifter), Discrete Appl. Math. 59 (1995) 129-136.   PDF  
• 19. Recognizing halved cubes in a constant time per edge (with W. Imrich, A. Vesel), European J. Combin. 16 (1995) 617-621.  PDF  
• 18. An algorithm for the calculation of the Szeged index of benzenoid hydrocarbons (with I. Gutman), J. Chem. Inf. Comput. Sci. 35 (1995) 1011-1014.  PDF  
• 17. Fast computation of the Wiener index of fasciagraphs and rotagraphs (with M. Juvan, B. Mohar, A. Graovac, J. Žerovnik), J. Chem. Inf. Comput. Sci. 35 (1995) 834-840.  PDF  
• 16. Labeling of benzenoid systems which reflects the vertex-distance relation (with I. Gutman, B. Mohar), J. Chem. Inf. Comput. Sci. 35 (1995) 590-593.  PDF  
• 15. The chromatic numbers of graph bundles over cycles (with B. Mohar), Discrete Math. 138 (1995) 301-314.  PDF  
• 14. Coloring graph bundles (with B. Mohar), J. Graph Theory 19 (1995) 145-156. PDF  
• 13. Improved bounds for the chromatic number of the lexicographic product of graph (with R. Kaschek), Indian J. Pure Appl. Math. 25 (1994) 1267-1274.  PDF  
• 12. On the chromatic number of the lexicographic product and the Cartesian sum of graphs (with N. Čižek), Discrete Math. 134 (1994) 17-24.  PDF  
• 11. Absolute retracts of split graphs, Discrete Math. 134 (1994) 75-84.  PDF  
• 10. Strong products of Kneser graphs (with U. Milutinović), Discrete Math. 133 (1994) 297-300.   PDF  
• 9. Strong products of χ-critical graphs, Aequationes Math. 45 (1993) 153-162.   PDF  
• 8. A simple O(mn) algorithm for recognizing Hamming graphs (with W. Imrich), Bull. Inst. Comb. Appl. 9 (1993) 45-56.  PDF  
• 7. An algorithm for identification of maliciously faulty units (with F. Novak), Inter. J. Comput. Math. 48 (1993) 21-29.   PDF  
• 6. Every n-dimensional grid is cordial (with J. Hagaeuer, G.J. Woeginger), Technische Universität Graz, Report No-248, 1992.   PDF  
• 5. Two remarks on retracts of graph products, Discrete Math. 109 (1992) 155-160.   PDF  
• 4. Graphs with nonempty intersection of longest paths (with M. Petkovšek), Ars Combin. 29 (1990) 43-52.   PDF  
• 3. On characterizations with forbidden subgraphs (with M. Petkovšek), Colloquia Mathematica Societies Janos Bolyai 52 Combinatorics, Eger (Hungary), 1987, North - Holland, Amsterdam - New York, 1989, 331-339.   PDF  
• 2. On system diagnosis for transient fault situations (with F. Novak, L. Gyergyek), Microproc. Microprog. 22 (1988) 273-275.   PDF  
• 1. Intersection graphs of halflines and halfplanes (with M. Petkovšek), Discrete Math. 66 (1987) 133-137.   PDF