Graphs with the unique path property: Structure, cycles, factors, and constructions
From MaRDI portal
Publication:6142656
DOI10.1002/jgt.23007zbMath1529.05091MaRDI QIDQ6142656
Publication date: 4 January 2024
Published in: Journal of Graph Theory (Search for Journal in Brave)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Switchings, extensions, and reductions in central digraphs
- Orderly algorithm to enumerate central groupoids and their graphs
- A directed graph version of strongly regular graphs
- Connection digraphs and second-order line digraphs
- Asymptotically-tight bounds on the number of cycles in generalized de Bruijn-Good graphs
- Some VLSI decompositions of the de Bruijn graph
- Universal cycles for combinatorial structures
- Rotating-table games and derivatives of words
- \(g\)-circulant solutions to the (0,1) matrix equation \(A^m=J_n\)
- Embedding de Bruijn, Kautz and shuffle-exchange networks in books
- On the existence of finite central groupoids of all possible ranks. I
- Central groupoids, central digraphs, and zero-one matrices \(A\) satisfying \(A^{2}=J\).
- On the complexities of de-Bruijn sequences
- On the g-circulant solutions to the matrix equation \(A^m=\lambda J\)
- Efficient exhaustive listings of reversible one dimensional cellular automata
- Spectra and elementary cycles of the digraphs with unique paths of fixed length
- Binary factorizations of the matrix of all ones
- A generalization of the matrix equation \(A^ 2=J\)
- A proof of Golomb's conjecture for the de Bruijn graph
- De Bruijn digraphs and affine transformations
- Codes for DNA Sequence Profiles
- Design of universal test sequences for VLSI
- Layouts for the Shuffle-Exchange Graph Based on the Complex Plane Diagram
- Algorithms for the generation of full-length shift- register sequences
- Construction of de Bruijn sequences of minimal complexity
- An Efficient Algorithm for Generating Linear Transformations in a Shuffle-Exchange Network
- A Survey of Full Length Nonlinear Shift Register Cycle Algorithms
- The depth distribution-a new characterization for linear codes
- Constructions for perfect maps and pseudorandom arrays
- UPP graphs and UMFA networks-architecture for parallel systems
- Fault-tolerant networks based on the de Bruijn graph
- On Eulerian and Hamiltonian Graphs and Line Graphs
- Notes on central groupoids
- Parallel Processing with the Perfect Shuffle
- On a Homomorphism of the de Bruijn Graph and its Applications to the Design of Feedback Shift Registers
- An Operator on Binary Sequences
- Derivatives of Binary Sequences
- Normal Recurring Decimals
- Generalized de Bruijn graphs
- Generalized de Bruijn graphs