Here are
published preprints. Published papers
can differ from the manuscripts
here!
[84] Grundy Packing Coloring of Graphs (with D. Gözüpek)
[83] Domination
number of modular product graphs (with S.
Bermudo, J. Sedlar, R. Škrekovski)
[82] Convex Geometries yielded by Transit
Functions (with
M. Changat, L. K. K. Sheela
and A. V. Shanavas)
[81] On Distance and Strong Metric Dimension of the Modular Product (with C. X. Kang, A. Kelenc and E. Yi)
[80] The Toll Walk Transit Function of a Graph: Axiomatic Characterizations and First-Order Non-definability (with M. Changat, J. Jacob and L. K. K. Sheela)
[79] On the simultaneous metric dimension of a graph and its complement (with C. X. Kang and E. Yi)
PDF Rocky Mountain J. Math. to appear.
[78] A new approach to b-coloring of regular graphs (with M. Dettlaff, H. Furmańczyk, R. Roux, R. Ziemann)
Appl. Math, Comput. 481 (2024) #128914.
[77] Resolving vertices of graphs with differences (with J. Sedlar, R. Škrekovski and I. G. Yero)
PDF Comput. Appl. Math. 43 (2024) #275.
[76] On some metric properties of direct-co-direct product (with A. Kelenc)
PDF Appl. Math, Comput. 457 (2023) 128152.
[75] The Simultaneous Fractional Dimension of Graph Families (with C. X. Kang and E. Yi)
PDF Acta Math. Sinica (English series) 39 (2023) 1425-1441.
[74] Axiomatic characterization of the toll walk function of some graph classes (with L. K. K. Sheela and M. Changat)
PDF Lecture Notes Comput. Sci. 13947 (2023) 427-446.
[73] Distance formula for direct-co-direct product in the case of disconnected factors (with A. Kelenc)
PDF Art Discrete Appl. Math. 6(2) (2023) p2.13 (21p).
[72]
On b-acyclic chromatic number of a graph
(with M. Anholcer
and S. Cichacz)
PDF Comput. Appl. Math. 42 (2023) #21 (20p).
[71] On the total co-independent domination number of some graph operations (with A. Cabrera Martínez, S. Cabrera García and I. G. Yero)
PDF Rev. Union Mat. Argent. 63 (2022) 153-168.
[70] Graphs with unique maximum packing of closed neighborhoods (with D. Božović)
PDF Discuss. Math. Graph
Theory 42 (2022) 779-797.
[69] Geodesic transversal problem for join and lexicographic product of graphs (with G. Semanišin)
PDF Comput. Appl. Math.
41 (2022) 128.
[68] Incidence dimension (with D. Božović, A. Kelenc and I. G. Yero)
PDF RAIRO-Oper.
Res. 56 (2022) 199-211. https://doi.org/10.1051/ro/2022001
[67] A Steiner general position
problem in graph theory (with S. Klavžar, D. Kuziak and I. G. Yero)
PDF Comput. Appl. Math. 40 (2021) 223.
[66] Roman domination in direct product graphs and rooted product graphs (with A. Cabrera Martínez and I. G. Yero)
PDF AIMS Math. 6(10) (2021) 11084-11096.
[65] On the maximal shortest path cover number (with G. Semanišin)
PDF Mathematics 9(14) (2021) 1592.
[64] On three outer independent domination related parameters in graphs (with D. A. Mojdeh, B. Samadi and I. G. Yero)
PDF Discrete Appl. Math. 294 (2021) 115-124.
[63] A note on the packing chromatic number of lexicographic
products (with D. Božović)
PDF Discrete Appl. Math. 293 (2021) 34-37.
[62] [1, k]-domination number of lexicographic product of graphs
(with N. Ghareghani and P. Sharifani)
PDF Bull. Malays. Math.
Sci. Soc. 44 (2021) 375-392.
[61] Independent transversal total domination versus total domination in trees (with A. Cabrera Martínez and I. G. Yero)
PDF Discuss. Math.
Graph Theory 41
(2021) 213–224.
10.7151/dmgt.2200
[60] Packing in graph products (with D. A. Mojdeh, B. Samadi and I. G. Yero)
PDF Discrete Math.
Theoret. Comput. Sci. 22 (2020) #1 (17p.).
[59] Dominating the direct
product of two graphs through
total Roman strategies (with
A. Cabrera Martínez, D. Kuziak
and I. G. Yero)
PDF Mathematics 8 (2020) #1438 (13
p.).
[58] Recognizing generalized Sierpiński graphs (with W. Imrich)
PDF Appl. Anal. Discrete Math.14 (2020) 122-137.
[57] Edge metric dimension of some graph operations
(with I. G. Yero)
PDF
Bull. Malays. Math. Sci.
Soc. 43 (2020) 2465-2477.
[56] Efficient open domination in digraph products (with D. Božović)
PDF Mathematics 8 (2020) #496 (14
p.).
[55] A note on bipartite
graphs whose [1, k]-domination number equal to their number of vertices (with N. Ghareghani and P. Sharifani)
PDF Opuscula Math. 40
(2020) 375-382.
[54] A Characterization
of Graphs with Disjoint Total Dominating Sets (with M. A. Henning)
PDF Ars Math.
Contemp. 16 (2019) 359-375.
[53] Efficient closed domination
of digraph products (with I. G. Yero)
PDF J. Combin.
Optim. 38 (2019) 130-149. https://doi.org/10.1007/s10878-018-0370-y
[52] The complexity
of open k-monopolies in graphs for negative k
PDF
Opuscula Math. 39
(2019) 425-431.
[51] A note on the Thue chromatic number of lexicographic
products of graphs (with J. Schreyer, E. Škrabul'áková and A. Taranenko)
PDF Discuss. Math.
Graph Theory 38 (2018)
635-643.
[50] The
Security Number of Lexicographic Products (with
T. Gologranc and M. Jakovac)
PDF Quaest. Math. 41 (2018) 601-613.
[49] Cartesian
products of directed graphs with loops (with W. Imrich)
PDF Discrete Math. 341 (2018) 1336-1343.
[48] Bounding
the open k-monopoly number of strong
product graphs (with D. Kuziak and I. G. Yero)
PDF Discuss.
Math. Graph Theory 38 (2018) 287-300. doi: 10.7151/dmgt.2017.
[47] Wiener
index of the strong product
of graphs (with P. Žigert Pleteršek)
PDF Opuscula Math. 38, no. 1 (2018) 81-94.
[46] The b-chromatic number-a survey (with M. Jakovac)
PDF Discrete Appl. Math. 235 (2018) 184-201. doi.org/10.1016/j.dam.2017.08.008
[45] Resolvability
and Strong Resolvability in the Direct Product of Graphs (with
D. Kuziak and I. G. Yero)
PDF Results Math. 71 (2017) 509-526.
[44] Graphs that are simultaneously efficient open domination
and efficient closed domination graphs (with S. Klavžar and I. G. Yero)
PDF Discrete Appl. Math. 217 (2017) 613-621.
[43] On the
(k-)monopolies
of lexicographic product graphs: bounds and closed
formulas (with D. Kuziak and I. G. Yero)
PDF Bull. Math. Soc. Sci. Math. Roumanie. 59(4) (2016)
355-366.
[42] On gated sets in graphs (with M. Changat
and A. Ramachandran)
PDF Taiwan.
J. Math. 20(3) (2016) 509-521.
[41] The Induced Path Transit
Function and the Pasch Axiom (with M.
Changat, A. Ramachandran, and A. Tepeh)
PDF Bull.
Malays. Math. Sci. Soc. 39 (2016) 123-134.
[40] Open k-monopolies in graphs: complexity and related concepts (with D. Kuziak and I. G. Yero)
PDF Discrete Math. Theoret. Comput. Sci.18(3) (2016) #1407.
[39] Spectra of graphs and closed
distance magic labelings (with M. Anholcer and S. Cichacz)
PDF Discrete
Math. 339 (2016) 1915-1923.
[38] Partitioning the vertex set of G to make G□H an efficient
open domination graph (with T. Kraner Šumenjak, D. F. Rall and A. Tepeh)
PDF Discrete Math. Theoret. Comput. Sci.18(3) (2016) #1503.
[37] The median game (with M.
Changat, D. S. Lekha, A. R. Subhamathi and S. Špacapan)
PDF Discrete
Optim. 17 (2015) 80-88.
[36] Hybrid
Evolutionary Algorithm for b-coloring (with I. Fister, M. Mernik and M.
Črepinšek)
PDF J. Heuristics 21 (2015) 501-521.
[35] The b-chromatic
index of direct product of graphs (with
I. Koch)
PDF Discrete Appl. Math.190-191 (2015) 109-117.
[34] The b-chromatic index of a graph
(with M. Jakovac)
PDF Bull.
Malays. Math. Sci. Soc. 38 (2015) 1375-1392.
[33] Distance magic labeling and two
products of graphs (with M. Anholcer, S. Cichacz, and A. Tepeh)
PDF Graphs Combin. 31 (2015) 1125-1136.
[32]
Computing the (k-)monopoly number of
direct product of graphs (with D. Kuziak
and I. G. Yero)
PDF FILOMAT 29 (2015)1163-1171.
[31] Toll convexity (with L. Alcón,
B. Brešar, T. Gologranc, M. Gutierrez, T. Kraner Šumenjak, A. Tepeh)
PDF European
J. Combin. 46 (2015) 161-175.
[30]
Pre-hull number of Cartesian and strong graph products
PDF J. Combin.
Math. Combin. Comput. 95 (2015) 55-64.
[29] Group distance magic labeling of
direct product of graphs (with M. Anholcer, S. Cichacz, and A. Tepeh)
PDF Ars Math. Contemp. 9 (2015) 93-107.
[28] Some Steiner Concepts on
Lexicographic Products of Graphs (with B. S. Anand, M. Changat, and P. G.
Narashimha-Shenoi)
PDF Discrete Math. Algorithms Appl. 6
(2014) 1450060.
[27] Erratum to ''Total domination number
of cartesian products'' [Math. Commun. 9 (2004) 35-44.] (with D. Kuziak and I.
G. Yero)
PDF Math.
Commun. 19 (2014) 195-200.
[26]
Efficient open domination in graph products
(with D. Kuziak and I. G. Yero)
PDF Discrete
Math. Theoret. Comput. Sci. 16 (2014) 105-120.
[25] Rainbow
connection and graph products (with T. Gologranc and G. Mekiš)
PDF Graphs
Combin. 30 (2014) 591-607.
[24]
Intervals and convex sets in strong product of graphs
PDF Graphs
Combin. 29 (2013) 705-714.
[23] A
forbidden subgraph characterization of some graph classes using betweenness
axioms
(with
M. Changat, A.K. Lakshmikuttyamma, J. Mathews, P.G. Narashimha-Shenoi, G. Seethakuttyamma, and S. Špacapan)
PDF Discrete
Math. 313 (2013) 951-958.
[22] Hamming dimension of a graph - the
case of Sierpiński graphs (with S. Klavžar and S.S. Zemljič)
PDF European
J. Combin. 34 (2013) 460-473.
[21]
Quasi-almostmedian graphs
PDF PS ARS Combin. 108 (2013) 105-115.
[20] Almost
self-centred median and chordal graphs (with K. Balakrishnan , B. Brešar, M.
Changat, S. Klavžar, and A. R. Subhamathi)
PDF Taiwan. J. Math. 16
(2012) 1911-1922.
[19] On the
b-chromatic number of some products (with M. Jakovac)
PDF Studia
Sci. Math. Hungar. 49 (2012) 156-169.
[18]
Pre-hull number and lexicographic product
PDF Discrete Math. 312 (2012)
2153-2157.
[17] Atoms
and Clique Separators in Graph Products (with B. S. Anand, K. Balakrishnan, and
M. Changat)
PDF Appl. Anal. Discrete
Math. 6 (2012) 46-62.
[16] Convex
sets in lexicographic product of graphs (with B.S. Anand, M. Changat, and S. Klavžar)
PDF Graphs Combin. 28 (2012) 77-84.
[15] A note
on 3-Steiner intervals and betweenness (with M. Changat, A.K. Lakshmikuttyamma,
J. Mathews, P.G. Narashimha-Shenoi, and A.Tepeh Horvat)
PDF Discrete Math. 311 (2011) 2601-2609.
[14] N-ary
transit functions in graphs (with M. Changat, J. Mathews, and P. G.
Narashimha-Shenoi)
PDF Discuss.
Math. Graph Theory 30 (2010) 671-685
[13] NZ-flows in strong products of graphs
(with W. Imrich, S. Špacapan, and C.Q. Zhang)
PDF J.
Graph Theory 64 (2010) 267-276.
[12] Steiner
intervals, geodesic intervals, and betweenness (with B. Brešar, M. Changat, J.
Mathews, P.G. Narashimha-Shenoi, and A.Tepeh Horvat)
PDF Discrete Math. 309 (2009) 6114-6125.
[11]
Strongly distance-balanced graphs and graph products (with K. Balakrishnan, M.
Changat, A. R. Subhamathi, S. Špacapan, and P. Šparl)
PDF PS European J. Combin. 30 (2009)
1048-1053.
[10]
Antimedian graphs (with K. Balakrishnan, M. Changat, S. Klavžar, J. Mathews, P.
G. Narashimha-Shenoi, and S. Špacapan)
PDF PS Australasian J. Combin. 41 (2008)
159-170.
[9] Game
chromatic number of Cartesian product graphs (with T. Bartnicki, B. Brešar, J.
Grytczuk, M. Kovše, and Z. Miechowicz)
PDF PS Electron. J. Combin. 15 (2008) #72.
[8] A
characterization of planar partial cubes
PDF PS Discrete Math. 308
(2008) 6596-6600.
[7]
Projection vectors and Fibonnaci and Lucas cubes (with S. Klavžar)
PDF Publ. Math. (Debr.) 71
(2007) 267-278.
[6]
Nonrepetitive colorings of trees (with B. Brešar, S. Klavžar, J. Grytczuk, and
S. Niwczyk)
PDF PS Discrete Math. 307 (2007) 163-172.
[5]
Recognizing Cartesian Products in Linear Time (with W. Imrich)
PDF PS Discrete Math. 307 (2007) 472-483.
[4] Fast
recognition of classes of almost-median graphs (with W. Imrich, A. Lipovec, and
P. Žigert)
PDF PS Discrete Math. 307 (2007) 464-471.
[3] A characterization
of planar median graphs
PDF PS Discussiones Math. Graph Theory 26
(2006) 41-48.
[2]
Characterizing subgraphs of Hamming graphs (with S. Klavžar)
PDF PS J.
Graph Theory 49 (2005) 302-312.
[1]
Characterizing flag graphs and induced subgraphs of Cartesian product graphs