A lower bound on the number of Hamiltonian cycles through a prescribed edge in a crossed cube (Q2016337): Difference between revisions

@@ Property / DOI @@
-.1016/j.amc.2013.03.128
@@ Property / DOI: 10.1016/j.amc.2013.03.128 / rank @@
-Normal rank
@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / rank @@
+Normal rank
@@ Property / full work available at URL @@
+https://doi.org/10.1016/j.amc.2013.03.128
+Normal rank
@@ Property / OpenAlex ID @@
+W2030148558
@@ Property / OpenAlex ID: W2030148558 / rank @@
+Normal rank
@@ Property / cites work @@
+On some super fault-tolerant Hamiltonian graphs
@@ Property / cites work: On some super fault-tolerant Hamiltonian graphs / rank @@
+Normal rank
@@ Property / cites work @@
+A recursively construction scheme for super fault-tolerant Hamiltonian graphs
+Normal rank
@@ Property / cites work @@
+Topological properties of the crossed cube architecture
+Normal rank
@@ Property / cites work @@
+Node-pancyclicity and edge-pancyclicity of crossed cubes
+Normal rank
@@ Property / cites work @@
+Fault-tolerant Hamiltonian connectedness of cycle composition networks
+Normal rank
@@ Property / cites work @@
+Q4002466
@@ Property / cites work: Q4002466 / rank @@
+Normal rank
@@ Property / cites work @@
+Fault-tolerant cycle-embedding of crossed cubes
@@ Property / cites work: Fault-tolerant cycle-embedding of crossed cubes / rank @@
+Normal rank
@@ Property / DOI @@
+.1016/J.AMC.2013.03.128
@@ Property / DOI: 10.1016/J.AMC.2013.03.128 / rank @@
+Normal rank
@@ links / mardi / name / links / mardi / name @@
+Publication:2016337