On Cayley Digraphs That Do Not Have Hamiltonian Paths

International Journal of Combinatorics
doi 10.1155/2013/725809
Full Text
Abstract

Available in full text

Date
Authors
Publisher

Hindawi Limited

Related search

Hamiltonian Cayley Digraphs on Direct Products of Dihedral Groups

Open Journal of Discrete Mathematics
2012English

Generalization of Transitive Cayley Digraphs

Journal of Mathematics Research
2012English

Strongly Regular M-Cayley Circulant Graphs and Digraphs

Ars Mathematica Contemporanea
AlgebraCombinatoricsNumber TheoryGeometryDiscrete MathematicsTheoretical Computer ScienceTopology
2014English

Hamilton Paths in Cayley Graphs on Generalized Dihedral Groups

Ars Mathematica Contemporanea
AlgebraCombinatoricsNumber TheoryGeometryDiscrete MathematicsTheoretical Computer ScienceTopology
2010English

Construction of Neural Networks That Do Not Have Critical Points Based on Hierarchical Structure

International Journal of Advanced Computer Science and Applications
Computer Science
2013English

Hamiltonian Decomposition of Cayley Graphs of Degree 4

Journal of Combinatorial Theory. Series B
CombinatoricsComputational TheoryDiscrete MathematicsTheoretical Computer ScienceMathematics
1989English

Cayley Graphs on Groups With Commutator Subgroup of Order 2p Are Hamiltonian

The Art of Discrete and Applied Mathematics
2018English

Paths With Two Blocks in N-Chromatic Digraphs

Journal of Combinatorial Theory. Series B
CombinatoricsComputational TheoryDiscrete MathematicsTheoretical Computer ScienceMathematics
2007English

A Matrix for Counting Paths in Acyclic Digraphs

Journal of Combinatorial Theory - Series A
CombinatoricsComputational TheoryDiscrete MathematicsTheoretical Computer ScienceMathematics
1996English

Amanote Research

Note-taking for researchers

Follow Amanote

© 2024 Amaplex Software S.P.R.L. All rights reserved.

Privacy PolicyRefund Policy