-
1
Packing 1-plane Hamiltonian cycles in complete geometric graphs
Published 2019“…Counting the number of Hamiltonian cycles that are contained in a geometric graph is #P-complete even if the graph is known to be planar [15]. …”
Get full text
Article -
2
Combinatorial properties of modified chordal rings degree four networks
Published 2010“…It is about interconnection between nodes, how the Hamiltonian cycle was occurred and why CHRm4 is not symmetric. …”
Get full text
Article -
3
On properties of modified degree six chordal rings network
Published 2010“…The properties are connectivity, Hamiltonian cycle and asymmetry. We prove some lemmas and theorems for every property. …”
Get full text
Article -
4
On some packing and partition problems in geometric graphs
Published 2018“…An algorithm for computing such 1-plane Hamiltonian cycles is also presented.…”
Get full text
Thesis