| Publication | Date of Publication | Type |
|---|
| Fibonacci Cubes with Applications and Variations | 2023-03-10 | Paper |
A Relation Between Wiener Index and Mostar Index for Daisy Cubes
Discrete Mathematics Letters | 2022-12-09 | Paper |
The (non-)existence of perfect codes in Lucas cubes
Ars Mathematica Contemporanea | 2022-07-15 | Paper |
A relation between Wiener index and Mostar index for daisy cubes
(available as arXiv preprint) | 2022-02-18 | Paper |
Edges in Fibonacci cubes, Lucas cubes and complements
Bulletin of the Malaysian Mathematical Sciences Society. Second Series | 2021-11-02 | Paper |
Daisy cubes and distance cube polynomial
European Journal of Combinatorics | 2019-07-10 | Paper |
The existence of perfect codes in a family of generalized Fibonacci cubes
Information Processing Letters | 2018-10-19 | Paper |
| Perfect codes in generalized Fibonacci cubes | 2018-01-12 | Paper |
Non covered vertices in Fibonacci cubes by a maximum set of disjoint hypercubes
Discrete Applied Mathematics | 2017-01-23 | Paper |
On disjoint hypercubes in Fibonacci cubes
Discrete Applied Mathematics | 2015-07-06 | Paper |
Edge decompositions of hypercubes by paths and by cycles
Graphs and Combinatorics | 2015-05-22 | Paper |
Asymptotic properties of Fibonacci cubes and Lucas cubes
Annals of Combinatorics | 2014-09-04 | Paper |
The domination number of Cartesian product of two directed paths
Journal of Combinatorial Optimization | 2014-02-25 | Paper |
| Covering codes in Sierpiński graphs | 2014-02-03 | Paper |
On the domination of Cartesian product of directed cycles: results for certain equivalence classes of lengths
Discussiones Mathematicae. Graph Theory | 2013-11-11 | Paper |
Weighted perfect codes in Lee metric
Electronic Notes in Discrete Mathematics | 2013-10-10 | Paper |
New results on variants of covering codes in Sierpiński graphs
Designs, Codes and Cryptography | 2013-08-05 | Paper |
Maximal hypercubes in Fibonacci and Lucas cubes
Discrete Applied Mathematics | 2012-10-19 | Paper |
| On domination of Cartesian product of directed cycles | 2012-05-24 | Paper |
The eccentricity sequences of Fibonacci and Lucas cubes
Discrete Mathematics | 2012-03-16 | Paper |
Cube polynomial of Fibonacci and Lucas cubes
Acta Applicandae Mathematicae | 2012-02-15 | Paper |
On vertex partitions of hypercubes by isometric trees
SIAM Journal on Discrete Mathematics | 2011-10-27 | Paper |
On the domination number and the 2-packing number of Fibonacci cubes and Lucas cubes
Computers & Mathematics with Applications | 2011-09-18 | Paper |
The degree sequence of Fibonacci and Lucas cubes
Discrete Mathematics | 2011-08-08 | Paper |
On perfect codes in Cartesian products of graphs
European Journal of Combinatorics | 2011-03-04 | Paper |
Weighted codes in Lee metrics
Designs, Codes and Cryptography | 2009-10-14 | Paper |
Power Domination in Product Graphs
SIAM Journal on Discrete Mathematics | 2009-05-27 | Paper |
Perfect codes in Cartesian products of hypercube and multidimensional grid
Electronic Notes in Discrete Mathematics | 2007-05-29 | Paper |
Hamming polynomials and their partial derivatives
European Journal of Combinatorics | 2007-04-10 | Paper |
A linear algorithm for minimum 1-identifying codes in oriented trees
Discrete Applied Mathematics | 2006-06-30 | Paper |
Codes and \(L(2,1)\)-labelings in Sierpiński graphs
Taiwanese Journal of Mathematics | 2006-06-26 | Paper |
Perfect codes in Cartesian products of 2-paths and infinite paths
The Electronic Journal of Combinatorics | 2006-01-17 | Paper |
Perfect codes in Cartesian products of 2-paths and infinite paths
The Electronic Journal of Combinatorics | 2006-01-17 | Paper |
Disjoint cycles and spanning graphs of hypercubes
Discrete Mathematics | 2005-01-13 | Paper |
Isometric embeddings of subdivided wheels in hypercubes
Discrete Mathematics | 2003-08-19 | Paper |
On paths and cycles dominating hypercubes
Discrete Mathematics | 2003-04-28 | Paper |
Spanning graphs of hypercubes: Starlike and double starlike trees
Discrete Mathematics | 2002-05-21 | Paper |
A counter-example to a lemma about embedding starlike trees into hypercube
Computers & Mathematics with Applications | 2001-11-12 | Paper |
On the nonexistence of three-dimensional tiling in the Lee metric. II
Discrete Mathematics | 2001-10-23 | Paper |
On two problems about (0, 2)-graphs and interval-regular graphs
Ars Combinatoria | 2001-06-10 | Paper |
Variations on tilings in the Manhattan metric
Geometriae Dedicata | 2001-03-04 | Paper |
Median graphs and hypercubes, some new characterizations
Discrete Mathematics | 1999-11-25 | Paper |
On the non-existence of 3-dimensional tiling in the Lee metric
European Journal of Combinatorics | 1999-04-08 | Paper |
On domination numbers of Cartesian products of paths
Discrete Applied Mathematics | 1998-10-27 | Paper |
| Spanning caterpillars of a hypercube | 1997-06-29 | Paper |
| scientific article; zbMATH DE number 554163 (Why is no real title available?) | 1994-06-07 | Paper |
Interval-regularity does not lead to interval monotonicity
Discrete Mathematics | 1994-03-17 | Paper |
Two characterizations of generalized hypercube
Discrete Mathematics | 1992-06-28 | Paper |
| A family of nonregular distance monotone graphs | 1992-06-25 | Paper |
Cycle-regular graphs
Discrete Mathematics | 1991-01-01 | Paper |
Some progress in the packing of equal circles in a square
Discrete Mathematics | 1990-01-01 | Paper |
On two conjectures about set-graceful graphs
European Journal of Combinatorics | 1989-01-01 | Paper |
Un nouvel encadrement du nombre de cycle Hamiltoniens du n-cube. (New bounds for the number of Hamiltonian cycles of the n-cube)
European Journal of Combinatorics | 1988-01-01 | Paper |
A Generalized Parity Function and Its Use in the Construction of Perfect Codes
SIAM Journal on Algebraic Discrete Methods | 1986-01-01 | Paper |
On shortest cocycle covers of graphs
Journal of Combinatorial Theory. Series B | 1985-01-01 | Paper |
Une nouvelle famille de 3-codes parfaits sur GF(q)
Discrete Mathematics | 1984-01-01 | Paper |
Le Nombre D'Absorption Du n–Cube
Combinatorial Mathematics, Proceedings of the International Colloquium on Graph Theory and Combinatorics | 1983-01-01 | Paper |
