Zbigniew R. Bogdanowicz

Publication Activity (10 Years)

Years Active: 1996-2023
Publications (10 Years): 10

Top Topics

Cartesian Product

Top Venues

Discret. Appl. Math.

Discuss. Math. Graph Theory

Publications

Zbigniew R. Bogdanowicz
On q-connected chordal graphs with minimum number of spanning trees. Discuss. Math. Graph Theory 43 (4) (2023)
Zbigniew R. Bogdanowicz
Hyper-Hamiltonian circulants. Electron. J. Graph Theory Appl. 9 (1) (2021)
Zbigniew R. Bogdanowicz
On the minimum number of spanning trees in cubic multigraphs. Discuss. Math. Graph Theory 40 (1) (2020)
Zbigniew R. Bogdanowicz
Identifying Hamilton cycles in the Cartesian product of directed cycles. AKCE Int. J. Graphs Comb. 17 (1) (2020)
Zbigniew R. Bogdanowicz
Isomorphism between circulants and Cartesian products of cycles. Discret. Appl. Math. 226 (2017)
Zbigniew R. Bogdanowicz
Flying Swarm of Drones Over Circulant Digraph. IEEE Trans. Aerosp. Electron. Syst. 53 (6) (2017)
Zbigniew R. Bogdanowicz
On decomposition of the Cartesian product of directed cycles into cycles of equal lengths. Discret. Appl. Math. 229 (2017)
Zbigniew R. Bogdanowicz, Ketula Patel
Quick Collateral Damage Estimation Based on Weapons Assigned to Targets. IEEE Trans. Syst. Man Cybern. Syst. 45 (5) (2015)
Zbigniew R. Bogdanowicz
Decomposition of circulant digraphs with two jumps into cycles of equal lengths. Discret. Appl. Math. 180 (2015)
Zbigniew R. Bogdanowicz
On isomorphism between circulant and Cartesian product of 2 cycles. Discret. Appl. Math. 194 (2015)
Zbigniew R. Bogdanowicz
Chordal 2-Connected Graphs and Spanning Trees. J. Graph Theory 76 (3) (2014)
Zbigniew R. Bogdanowicz
Antidirected Hamilton cycles in the Cartesian product of directed cycles. Ars Comb. 114 (2014)
Zbigniew R. Bogdanowicz
Arc-Disjoint and Edge-Disjoint Hamilton Cycles in Circulants with Two Jumps. Graphs Comb. 29 (2) (2013)
Zbigniew R. Bogdanowicz
Cubic Graphs with Minimum Number of Spanning Trees. Ars Comb. 110 (2013)
Zbigniew R. Bogdanowicz
On Properties of Working Paths in Optimal Set of Survivable Paths. Ars Comb. 109 (2013)
Zbigniew R. Bogdanowicz
On Family of Graphs with Minimum Number of Spanning Trees. Graphs Comb. 29 (6) (2013)
Zbigniew R. Bogdanowicz, Antony Tolano, Ketula Patel, Norman P. Coleman
Optimization of Weapon-Target Pairings Based on Kill Probabilities. IEEE Trans. Cybern. 43 (6) (2013)
Zbigniew R. Bogdanowicz
Advanced Input Generating Algorithm for Effect-Based Weapon-Target Pairing Optimization. IEEE Trans. Syst. Man Cybern. Part A 42 (1) (2012)
Zbigniew R. Bogdanowicz
On arc reversal in balanced digraphs. Discret. Math. 311 (6) (2011)
Zbigniew R. Bogdanowicz
Hamilton cycles in circulant digraphs with prescribed number of distinct jumps. Discret. Math. 309 (8) (2009)
Zbigniew R. Bogdanowicz
A new efficient algorithm for optimal assignment of smart weapons to targets. Comput. Math. Appl. 58 (10) (2009)
Zbigniew R. Bogdanowicz
Undirected simple connected graphs with minimum number of spanning trees. Discret. Math. 309 (10) (2009)
Zbigniew R. Bogdanowicz, Norman P. Coleman
New Algorithm for Optimization of Effect-Based Weapon-Target Pairings. CSC (2008)
Zbigniew R. Bogdanowicz
Hamiltonian Circuits in Sparse Circulant Digraphs. Ars Comb. 76 (2005)
Zbigniew R. Bogdanowicz
Analysis of Optimal Sets of Survivable Paths in Undirected Simple Graph Applicable for Optical Networks. Electron. Notes Discret. Math. 22 (2005)
Zbigniew R. Bogdanowicz, Somdip Datta
Analysis of backup route reoptimization algorithms for optical shared mesh networks. Math. Comput. Model. 40 (9-10) (2004)
Zbigniew R. Bogdanowicz, Norman P. Coleman
Efficient Methodology and Robust Infrastructure for Assigning Weapons to Targets. MSV/AMCS (2004)
Zbigniew R. Bogdanowicz
Pancyclicity of connected circulant graphs. J. Graph Theory 22 (2) (1996)