2024
Extremal Edge General Position Sets in Some Graphs.
Graphs Comb., April, 2024
Packings in bipartite prisms and hypercubes.
Discret. Math., April, 2024
Partial domination in supercubic graphs.
Discret. Math., January, 2024
Mutual-visibility problems on graphs of diameter two.
CoRR, 2024
2023
New transmission irregular chemical graphs.
Discret. Appl. Math., December, 2023
Geodesic packing in graphs.
Appl. Math. Comput., December, 2023
Computational complexity aspects of super domination.
Theor. Comput. Sci., October, 2023
A characterization of 4-χS-vertex-critical graphs for packing sequences with s1=1 and s2≥3.
Discret. Appl. Math., October, 2023
Variety of mutual-visibility problems in graphs.
Theor. Comput. Sci., September, 2023
Redefining fractal cubic networks and determining their metric dimension and fault-tolerant metric dimension.
Appl. Math. Comput., September, 2023
The geodesic transversal problem on some networks.
Comput. Appl. Math., February, 2023
Orientable domination in product-like graphs.
Discret. Appl. Math., 2023
Leap eccentric connectivity index in graphs with universal vertices.
Appl. Math. Comput., 2023
On the mutual visibility in Cartesian products and triangle-free graphs.
Appl. Math. Comput., 2023
Fibonacci Cubes with Applications and Variations
WorldScientific, ISBN: 9789811269165, 2023
2022
Predominating a Vertex in the Connected Domination Game.
Graphs Comb., 2022
1/2-conjectures on the domination game and claw-free graphs.
Eur. J. Comb., 2022
On the chromatic vertex stability number of graphs.
Eur. J. Comb., 2022
Relating the total domination number and the annihilation number for quasi-trees and some composite graphs.
Discret. Math., 2022
The general position achievement game played on graphs.
Discret. Appl. Math., 2022
The geodesic cover problem for butterfly networks.
CoRR, 2022
The general position avoidance game and hardness of general position games.
CoRR, 2022
Twin vertices in fault-tolerant metric sets and fault-tolerant metric dimension of multistage interconnection networks.
Appl. Math. Comput., 2022
The geodesic-transversal problem.
Appl. Math. Comput., 2022
2021
Lower bounds for dilation, wirelength, and edge congestion of embedding graphs into hypercubes.
J. Supercomput., 2021
The Steiner <i>k</i>-eccentricity on trees.
Theor. Comput. Sci., 2021
Edge metric dimensions via hierarchical product and integer linear programming.
Optim. Lett., 2021
An algorithm for embedding Turán graphs into incomplete hypercubes with minimum wirelength.
J. Graph Algorithms Appl., 2021
On the relation between Wiener index and eccentricity of a graph.
J. Comb. Optim., 2021
Correcting the algorithm for the secure domination number of cographs by Jha, Pradhan, and Banerjee.
Inf. Process. Lett., 2021
On ℓ-Distance-Balanced Product Graphs.
Graphs Comb., 2021
On the General Position Number of Complementary Prisms.
Fundam. Informaticae, 2021
The general position problem on Kneser graphs and on some graph operations.
Discuss. Math. Graph Theory, 2021
On Grundy total domination number in product graphs.
Discuss. Math. Graph Theory, 2021
Constructing new families of transmission irregular graphs.
Discret. Appl. Math., 2021
Comparing Wiener complexity with eccentric complexity.
Discret. Appl. Math., 2021
On the average Steiner 3-eccentricity of trees.
Discret. Appl. Math., 2021
On the computational complexity of the Steiner k-eccentricity.
CoRR, 2021
A Steiner general position problem in graph theory.
Comput. Appl. Math., 2021
Transmission in H-naphtalenic nanosheet.
Appl. Math. Comput., 2021
Dominated and dominator colorings over (edge) corona and hierarchical products.
Appl. Math. Comput., 2021
Some binary products and integer linear programming for k-metric dimension of graphs.
Appl. Math. Comput., 2021
The general position number of integer lattices.
Appl. Math. Comput., 2021
2020
Nordhaus-Gaddum and other bounds for the chromatic edge-stability number.
Eur. J. Comb., 2020
A survey on packing colorings.
Discuss. Math. Graph Theory, 2020
Strong geodetic problems in networks.
Discuss. Math. Graph Theory, 2020
Trees with distinguishing index equal distinguishing number plus one.
Discuss. Math. Graph Theory, 2020
The annihilation number does not bound the 2-domination number from the above.
Discret. Math., 2020
Critical graphs for the chromatic edge-stability number.
Discret. Math., 2020
S-packing chromatic vertex-critical graphs.
Discret. Appl. Math., 2020
Maker-Breaker total domination game.
Discret. Appl. Math., 2020
Local metric dimension of graphs: Generalized hierarchical products and some applications.
Appl. Math. Comput., 2020
A lower bound and several exact results on the <i>d</i>-lucky number.
Appl. Math. Comput., 2020
2019
M-polynomial revisited: Bethe cacti and an extension of Gutman's approach.
J. Appl. Math. Comput., June, 2019
Exact Distance Graphs of Product Graphs.
Graphs Comb., 2019
Fast Winning Strategies for the Maker-Breaker Domination Game.
Proceedings of the tenth Latin and American Algorithms, Graphs and Optimization Symposium, 2019
Daisy cubes and distance cube polynomial.
Eur. J. Comb., 2019
Packing chromatic vertex-critical graphs.
Discret. Math. Theor. Comput. Sci., 2019
A note on the Frame-Stewart conjecture.
Discret. Math. Algorithms Appl., 2019
Domination game and minimal edge cuts.
Discret. Math., 2019
Cutting lemma and union lemma for the domination game.
Discret. Math., 2019
Metric properties of generalized Sierpiński graphs over stars.
Discret. Appl. Math., 2019
On the Djoković-Winkler relation and its closure in subdivisions of fullerenes, triangulations, and chordal graphs.
CoRR, 2019
Distribution of global defensive <i>k</i>-alliances over some graph products.
Central Eur. J. Oper. Res., 2019
Strong geodetic cores and Cartesian product graphs.
Appl. Math. Comput., 2019
Characterization of general position sets and its applications to cographs and bipartite graphs.
Appl. Math. Comput., 2019
2018
Strong geodetic problem on Cartesian products of graphs.
RAIRO Oper. Res., 2018
Embeddings into almost self-centered graphs of given radius.
J. Comb. Optim., 2018
The Graph Theory General Position Problem on Some Interconnection Networks.
Fundam. Informaticae, 2018
On graphs with largest possible game domination number.
Discret. Math., 2018
On the difference between the (revised) Szeged index and the Wiener index of cacti.
Discret. Appl. Math., 2018
Game total domination critical graphs.
Discret. Appl. Math., 2018
On domination-type invariants of Fibonacci cubes and hypercubes.
Ars Math. Contemp., 2018
General Transmission Lemma and Wiener complexity of triangular grids.
Appl. Math. Comput., 2018
On graphs whose Wiener complexity equals their order and on Wiener index of asymmetric graphs.
Appl. Math. Comput., 2018
Professor Wilfried Imrich awarded honorary doctorate at the University of Maribor.
Art Discret. Appl. Math., 2018
2017
On the Structure of Dominating Graphs.
Graphs Comb., 2017
How long can one bluff in the domination game?.
Discuss. Math. Graph Theory, 2017
Packing chromatic number under local changes in a graph.
Discret. Math., 2017
Grundy dominating sequences and zero forcing sets.
Discret. Optim., 2017
On the signed Roman k-domination: Complexity and thin torus graphs.
Discret. Appl. Math., 2017
Graphs that are simultaneously efficient open domination and efficient closed domination graphs.
Discret. Appl. Math., 2017
A survey and classification of Sierpiński-type graphs.
Discret. Appl. Math., 2017
(Total) Domination in Prisms.
Electron. J. Comb., 2017
The 4/5 upper bound on the game total domination number.
Comb., 2017
2016
Complexity of the game domination problem.
Theor. Comput. Sci., 2016
The (non-)existence of perfect codes in Fibonacci cubes.
Inf. Process. Lett., 2016
Improved Upper Bounds on the Domination Number of Graphs With Minimum Degree at Least Five.
Graphs Comb., 2016
Packing Chromatic Number of Base-3 Sierpiński Graphs.
Graphs Comb., 2016
On isomorphism classes of generalized Fibonacci cubes.
Eur. J. Comb., 2016
Edge-transitive lexicographic and Cartesian products.
Discuss. Math. Graph Theory, 2016
Dominating Sequences in Grid-Like and Toroidal Graphs.
Electron. J. Comb., 2016
Labeling Dot-Cartesian and Dot-Lexicographic Product Graphs with a Condition at Distance Two.
Comput. J., 2016
Average Distance in Interconnection Networks via Reduction Theorems for Vertex-Weighted Graphs.
Comput. J., 2016
Bojan Mohar's 60th Birthday.
Ars Math. Contemp., 2016
Wilfried Imrich's 75th Birthday Colloquium.
Ars Math. Contemp., 2016
Modified Wiener index via canonical metric representation, and some fullerene patches.
Ars Math. Contemp., 2016
2015
Moore Graphs and Cycles Are Extremal Graphs for Convex Cycles.
J. Graph Theory, 2015
Local colourings of Cartesian product graphs.
Int. J. Comput. Math., 2015
Total Version of the Domination Game.
Graphs Comb., 2015
Guarded subgraphs and the domination game.
Discret. Math. Theor. Comput. Sci., 2015
Connectivity of Fibonacci cubes, Lucas cubes, and generalized cubes.
Discret. Math. Theor. Comput. Sci., 2015
Domination game critical graphs.
Discuss. Math. Graph Theory, 2015
Weighted Harary indices of apex trees and k-apex trees.
Discret. Appl. Math., 2015
On the Wiener index of generalized Fibonacci cubes and Lucas cubes.
Discret. Appl. Math., 2015
2014
Average distance, surface area, and other structural properties of exchanged hypercubes.
J. Supercomput., 2014
The domination number of exchanged hypercubes.
Inf. Process. Lett., 2014
Cut method and Djoković-Winkler's relation.
Electron. Notes Discret. Math., 2014
Improved bounds on the difference between the Szeged index and the Wiener index of graphs.
Eur. J. Comb., 2014
Wiener index in weighted graphs via unification of <i>Θ</i><sup>∗</sup>Θ∗-classes.
Eur. J. Comb., 2014
Fibonacci (p, r)-cubes as Cartesian products.
Discret. Math., 2014
On the difference between the revised Szeged index and the Wiener index.
Discret. Math., 2014
Domination game: Effect of edge- and vertex-removal.
Discret. Math., 2014
Equal opportunity networks, distance-balanced graphs, and Wiener game.
Discret. Optim., 2014
Computing distance moments on graphs with transitive Djoković-Winkler relation.
Discret. Appl. Math., 2014
2013
Structure of Fibonacci cubes: a survey.
J. Comb. Optim., 2013
Hamming dimension of a graph - The case of Sierpiński graphs.
Eur. J. Comb., 2013
Domination game played on trees and spanning subgraphs.
Discret. Math., 2013
Wiener index versus Szeged index in networks.
Discret. Appl. Math., 2013
Domination game: Extremal families of graphs for 3/53/5-conjectures.
Discret. Appl. Math., 2013
The Tower of Hanoi - Myths and Maths.
Birkhäuser, ISBN: 978-3-0348-0236-9, 2013
2012
The index of a binary word.
Theor. Comput. Sci., 2012
Convex excess in partial cubes.
J. Graph Theory, 2012
Vizing's conjecture: a survey and recent results.
J. Graph Theory, 2012
Convex Sets in Lexicographic Products of Graphs.
Graphs Comb., 2012
Asymptotic number of isometric generalized Fibonacci cubes.
Eur. J. Comb., 2012
On the rainbow connection of Cartesian products and their subgraphs.
Discuss. Math. Graph Theory, 2012
Characterizing almost-median graphs II.
Discret. Math., 2012
Generalized Fibonacci cubes.
Discret. Math., 2012
A characterization of 1-cycle resonant graphs among bipartite 2-connected plane graphs.
Discret. Appl. Math., 2012
Parity Index of Binary Words and Powers of Prime Words.
Electron. J. Comb., 2012
2011
On Idomatic Partitions of Direct Products of Complete Graphs.
Graphs Comb., 2011
The degree sequence of Fibonacci and Lucas cubes.
Discret. Math., 2011
Two-ended regular median graphs.
Discret. Math., 2011
The Fibonacci Dimension of a Graph.
Electron. J. Comb., 2011
On the domination number and the 2-packing number of Fibonacci cubes and Lucas cubes.
Comput. Math. Appl., 2011
Computing quadratic entropy in evolutionary trees.
Comput. Math. Appl., 2011
2010
Domination Game and an Imagination Strategy.
SIAM J. Discret. Math., 2010
Simultaneous embeddings of graphs as median and antimedian subgraphs.
Networks, 2010
The b-Chromatic Number of Cubic Graphs.
Graphs Comb., 2010
On distance-balanced graphs.
Eur. J. Comb., 2010
Covering codes in Sierpinski graphs.
Discret. Math. Theor. Comput. Sci., 2010
The distinguishing chromatic number of Cartesian products of two complete graphs.
Discret. Math., 2010
Maximum cardinality resonant sets and maximal alternating sets of hexagonal systems.
Comput. Math. Appl., 2010
Computing median and antimedian sets in median graphs.
Algorithmica, 2010
2009
Transitive, Locally Finite Median Graphs with Finite Blocks.
Graphs Comb., 2009
The packing chromatic number of infinite product graphs.
Eur. J. Comb., 2009
Induced cycles in crossing graphs of median graphs.
Discret. Math., 2009
Vertex-, edge-, and total-colorings of Sierpinski-like graphs.
Discret. Math., 2009
The Clar formulas of a benzenoid system and the resonance graph.
Discret. Appl. Math., 2009
On the remoteness function in median graphs.
Discret. Appl. Math., 2009
Characterizing posets for which their natural transit functions coincide.
Ars Math. Contemp., 2009
On Even and Harmonic-Even Partial Cubes.
Ars Comb., 2009
2008
Improved Bounds on the L(2, 1)-Number of Direct and Strong Products of Graphs.
IEEE Trans. Circuits Syst. II Express Briefs, 2008
Power Domination in Product Graphs.
SIAM J. Discret. Math., 2008
Cover-Incomparability Graphs of Posets.
Order, 2008
On the Packing Chromatic Number of Trees, Cartesian Products and Some Infinite Graphs.
Electron. Notes Discret. Math., 2008
The distinguishing number of Cartesian products of complete graphs.
Eur. J. Comb., 2008
On the geodetic number and related metric sets in Cartesian product graphs.
Discret. Math., 2008
The median function on graphs with bounded profiles.
Discret. Appl. Math., 2008
2007
Crossing Graphs as Joins of Graphs and Cartesian Products of Median Graphs.
SIAM J. Discret. Math., 2007
On the packing chromatic number of Cartesian products, hexagonal lattice, and trees.
Electron. Notes Discret. Math., 2007
Cartesian powers of graphs can be distinguished by two labels.
Eur. J. Comb., 2007
Partial cubes and their tau-graphs.
Eur. J. Comb., 2007
Hamming polynomials and their partial derivatives.
Eur. J. Comb., 2007
Tribes of Cubic Partial Cubes.
Discret. Math. Theor. Comput. Sci., 2007
On <i>Tetha</i>-graphs of partial cubes.
Discuss. Math. Graph Theory, 2007
On cube-free median graphs.
Discret. Math., 2007
Dominating direct products of graphs.
Discret. Math., 2007
Maximal proper subgraphs of median graphs.
Discret. Math., 2007
Nonrepetitive colorings of trees.
Discret. Math., 2007
Cancellation properties of products of graphs.
Discret. Appl. Math., 2007
Strong Isometric Dimension, Biclique Coverings, and Sperner's Theorem.
Comb. Probab. Comput., 2007
Distinguishing Infinite Graphs.
Electron. J. Comb., 2007
On plane bipartite graphs without fixed edges.
Appl. Math. Lett., 2007
2006
The Δ<sup>2</sup>-conjecture for L(2, 1)-labelings is true for direct and strong products of graphs.
IEEE Trans. Circuits Syst. II Express Briefs, 2006
Distinguishing Cartesian powers of graphs.
J. Graph Theory, 2006
Roots of cube polynomials of median graphs.
J. Graph Theory, 2006
On the canonical metric representation, average distance, and partial Hamming graphs.
Eur. J. Comb., 2006
Some results on total domination in direct products of graphs.
Discuss. Math. Graph Theory, 2006
On the role of hypercubes in the resonance graphs of benzenoid graphs.
Discret. Math., 2006
Counting hypercubes in hypercubes.
Discret. Math., 2006
On induced and isometric embeddings of graphs into the strong product of paths.
Discret. Math., 2006
<i>Theta</i>-graceful labelings of partial cubes.
Discret. Math., 2006
A theorem on Wiener-type invariants for isometric subgraphs of hypercubes.
Appl. Math. Lett., 2006
An almost complete description of perfect codes in direct products of cycles.
Adv. Appl. Math., 2006
2005
Hypercubes As Direct Products.
SIAM J. Discret. Math., 2005
Characterizing subgraphs of Hamming graphs.
J. Graph Theory, 2005
Crossing numbers of Sierpinski-like graphs.
J. Graph Theory, 2005
Characterizing r-perfect codes in direct products of two and three cycles.
Inf. Process. Lett., 2005
Metric properties of the Tower of Hanoi graphs and Stern's diatomic sequence.
Eur. J. Comb., 2005
Median and quasi-median direct products of graphs.
Discuss. Math. Graph Theory, 2005
On median nature and enumerative properties of Fibonacci-like cubes.
Discret. Math., 2005
Reconstructing subgraph-counting graph polynomials of increasing families of graphs.
Discret. Math., 2005
Optimal <i>L</i>(<i>d</i>, 1)-labelings of certain direct products of cycles and Cartesian products of cycles.
Discret. Appl. Math., 2005
<i>L</i>(2, 1)-labeling of direct product of paths and cycles.
Discret. Appl. Math., 2005
Some new bounds and exact results on the independence number of Cartesian product graphs.
Ars Comb., 2005
2004
Cubic inflation, mirror graphs, regular maps, and partial cubes.
Eur. J. Comb., 2004
Edge-critical isometric subgraphs of hypercubes.
Ars Comb., 2004
Square-free colorings of graphs.
Ars Comb., 2004
2003
Quasi-median graphs, their generalizations, and tree-like equalities.
Eur. J. Comb., 2003
Discuss. Math. Graph Theory, 2003
Tree-like isometric subgraphs of hypercubes.
Discuss. Math. Graph Theory, 2003
Partial cubes as subdivision graphs and as generalized Petersen graphs.
Discret. Math., 2003
Isometric embeddings of subdivided wheels in hypercubes.
Discret. Math., 2003
Computing graph invariants on rotagraphs using dynamic algorithm approach: the case of (2, 1)-colorings and independence numbers.
Discret. Appl. Math., 2003
Fast recognition algorithms for classes of partial cubes.
Discret. Appl. Math., 2003
The Cube Polynomial and its Derivatives: the Case of Median Graphs.
Electron. J. Comb., 2003
On cubic and edge-critical isometric subgraphs of hypercubes.
Australas. J Comb., 2003
2002
Partial Cubes and Crossing Graphs.
SIAM J. Discret. Math., 2002
Three Methods for Calculation of the Hyper-Wiener Index of Molecular Graphs.
J. Chem. Inf. Comput. Sci., 2002
Resonance graphs of catacondensed even ring systems are median.
Discret. Math., 2002
On subgraphs of Cartesian product graphs.
Discret. Math., 2002
On the fractional chromatic number, the chromatic number, and graph products.
Discret. Math., 2002
On the Frame-Stewart algorithm for the multi-peg Tower of Hanoi problem.
Discret. Appl. Math., 2002
A min-max result on catacondensed benzenoid graphs.
Appl. Math. Lett., 2002
2001
Cubes polynomial and its derivatives.
Electron. Notes Discret. Math., 2001
Binary Coding of Kekulé Structures of Catacondensed Benzenoid Hydrocarbons.
Comput. Chem., 2001
Combinatorics of topmost discs of multi-peg Tower of Hanoi problem.
Ars Comb., 2001
2000
On median graphs and median grid graphs.
Discret. Math., 2000
An Algorithm for the Calculation of the Hyper-Wiener Index of Benzenoid Hydrocarbons.
Comput. Chem., 2000
1999
Recognizing Median Graphs in Subquadratic Time.
Theor. Comput. Sci., 1999
Median Graphs and Triangle-Free Graphs.
SIAM J. Discret. Math., 1999
Graphs which Locally Mirror the Hypercube Structure.
Inf. Process. Lett., 1999
On the Frame-Stewarr algorithm for the multi-peg Tower of Hanoi problem (Extended Abstract).
Electron. Notes Discret. Math., 1999
Recognizing Graphs of Acyclic Cubical Complexes.
Discret. Appl. Math., 1999
On Analog Signature Analysis.
Proceedings of the 1999 Design, 1999
1998
A Convexity Lemma and Expansion Procedures for Bipartite Graphs.
Eur. J. Comb., 1998
An Euler-type formula for median graphs.
Discret. Math., 1998
On the fractional chromatic number and the lexicographic product of graphs.
Discret. Math., 1998
Distances in benzenoid systems: Further developments.
Discret. Math., 1998
Independence in Direct-Product Graphs.
Ars Comb., 1998
A characterization of halved cubes.
Ars Comb., 1998
Applications of isometric embeddings to chemical graphs.
Proceedings of the Discrete Mathematical Chemistry, 1998
1997
Bounds for the Schultz Molecular Topological Index of Benzenoid Systems in Terms of the Wiener Index.
J. Chem. Inf. Comput. Sci., 1997
The Wiener Index and the Szeged Index of Benzenoid Systems in Linear Time.
J. Chem. Inf. Comput. Sci., 1997
Recognizing Hamming Graphs in Linear Time and space.
Inf. Process. Lett., 1997
Isomorphic components of Kronecker product of bipartite graphs.
Discuss. Math. Graph Theory, 1997
Wiener Number of Vertex-weighted Graphs and a Chemical Application.
Discret. Appl. Math., 1997
Distributed multicast routing in point-to-point networks.
Comput. Oper. Res., 1997
1996
A Comparison of the Schultz Molecular Topological Index with the Wiener Index.
J. Chem. Inf. Comput. Sci., 1996
On the Complexity of Recognizing Hamming Graphs and Related Classes of Graphs.
Eur. J. Comb., 1996
On a Vizing-like conjecture for direct product graphs.
Discret. Math., 1996
Coloring graph products - A survey.
Discret. Math., 1996
Algebraic Approach to Fasciagraphs and Rotagraphs.
Discret. Appl. Math., 1996
On independence numbers of the cartesian product of graphs.
Ars Comb., 1996
1995
Labeling of Benzenoid Systems which Reflects the Vertex-Distance Relations.
J. Chem. Inf. Comput. Sci., 1995
Fast computation of the Wiener index of fasciagraphs and rotagraphs.
J. Chem. Inf. Comput. Sci., 1995
An Algorithm for the Calculation of the Szeged Index of Benzenoid Hydrocarbons.
J. Chem. Inf. Comput. Sci., 1995
Recognizing halved cubes in a constant time per edge.
Eur. J. Comb., 1995
The chromatic numbers of graph bundles over cycles.
Discret. Math., 1995
Dominating Cartesian Products of Cycles.
Discret. Appl. Math., 1995
1994
Strong products of Kneser graphs.
Discret. Math., 1994
Absolute retracts of split graphs.
Discret. Math., 1994
On the chromatic number of the lexicographic product and the Cartesian sum of graphs.
Discret. Math., 1994
Dynamic Programming and Convex Clustering.
Algorithmica, 1994
1992
Two remarks on retracts of graph products.
Discret. Math., 1992
Retracts of strong products of graphs.
Discret. Math., 1992
1988
On system diagnosis for transient fault situations.
Microprocess. Microprogramming, 1988
1987
Intersection graphs of halflines and halfplanes.
Discret. Math., 1987
