| Publication | Date of Publication | Type |
|---|
The number of spanning trees in a superprism
DML. Discrete Mathematics Letters | 2024-06-25 | Paper |
On arc reversal in digraphs with a restricted number of cycles
| 2023-11-27 | Paper |
When the Cartesian product of directed cycles is hyper-Hamiltonian
Discrete Mathematics Letters | 2022-11-23 | Paper |
On hyper-Hamiltonian Cartesian product of undirected cycles
Discrete Mathematics Letters | 2022-11-23 | Paper |
Identifying Hamilton cycles in the Cartesian product of directed cycles
AKCE International Journal of Graphs and Combinatorics | 2021-10-05 | Paper |
Hyper-Hamiltonian circulants
Electronic Journal of Graph Theory and Applications | 2021-09-06 | Paper |
On the minimum number of spanning trees in cubic multigraphs
Discussiones Mathematicae Graph Theory | 2020-01-08 | Paper |
Hamiltonicity properties of circulant digraphs of semiprime or power of prime order
Far East Journal of Mathematical Sciences (FJMS) | 2017-11-10 | Paper |
On decomposition of the Cartesian product of directed cycles into cycles of equal lengths
Discrete Applied Mathematics | 2017-07-27 | Paper |
Isomorphism between circulants and Cartesian products of cycles
Discrete Applied Mathematics | 2017-06-14 | Paper |
Effect-based weapon-target assignment with minimised collateral damage
International Journal of Operational Research | 2017-05-31 | Paper |
On isomorphism between circulant and Cartesian product of 2 cycles
Discrete Applied Mathematics | 2015-09-01 | Paper |
Antidirected Hamilton cycles in the Cartesian product of directed cycles.
| 2015-04-13 | Paper |
Decomposition of circulant digraphs with two jumps into cycles of equal lengths
Discrete Applied Mathematics | 2014-11-28 | Paper |
Cubic graphs with minimum number of spanning trees.
| 2014-09-19 | Paper |
Chordal 2-connected graphs and spanning trees
Journal of Graph Theory | 2014-08-07 | Paper |
scientific article; zbMATH DE number 6260127 (Why is no real title available?)
| 2014-02-19 | Paper |
On family of graphs with minimum number of spanning trees
Graphs and Combinatorics | 2014-02-14 | Paper |
Arc-disjoint and edge-disjoint Hamilton cycles in circulants with two jumps
Graphs and Combinatorics | 2013-05-13 | Paper |
Decomposition of circulants into antidirected Hamilton cycles
| 2013-05-08 | Paper |
Antidirected Hamilton cycles in circulant digraphs
| 2013-05-06 | Paper |
On the arc reversal and closed walks with prescribed bounds on arcs visits
| 2012-11-09 | Paper |
On the arc reversal properties of digraphs without loops
Applied Mathematical Sciences (Ruse) | 2012-09-04 | Paper |
scientific article; zbMATH DE number 5883895 (Why is no real title available?)
| 2011-05-04 | Paper |
On arc reversal in balanced digraphs
Discrete Mathematics | 2011-02-18 | Paper |
Quality index of balanced digraphs
| 2010-07-22 | Paper |
A new efficient algorithm for optimal assignment of smart weapons to targets
Computers & Mathematics with Applications | 2010-06-28 | Paper |
Undirected simple connected graphs with minimum number of spanning trees
Discrete Mathematics | 2009-06-23 | Paper |
Hamilton cycles in circulant digraphs with prescribed number of distinct jumps
Discrete Mathematics | 2009-06-19 | Paper |
Formulas for the number of spanning trees in a fan
| 2008-08-12 | Paper |
Arc perturbation algorithms for optical network design
| 2007-10-30 | Paper |
Analysis of Optimal Sets of Survivable Paths in Undirected Simple Graph Applicable for Optical Networks
Electronic Notes in Discrete Mathematics | 2007-05-29 | Paper |
scientific article; zbMATH DE number 5064035 (Why is no real title available?)
| 2006-10-16 | Paper |
Pancyclicity of connected circulant graphs
| 1996-07-23 | Paper |
A new optimal algorithm for backbone topology design in communications networks
Mathematical and Computer Modelling | 1994-12-04 | Paper |
