On Leaf Node Edge Switchings in Spanning Trees of De Bruijn Graphs
DOI10.1007/978-981-13-0023-3_11zbMATH Open1459.05152OpenAlexW2796514008MaRDI QIDQ5114859FDOQ5114859
Srinivasan Krishnaswamy, Suman Roy, P. Vinod Kumar
Publication date: 29 June 2020
Published in: Communications in Computer and Information Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-981-13-0023-3_11
Permutations, words, matrices (05A05) Directed graphs (digraphs), tournaments (05C20) Shift register sequences and sequences over finite alphabets in information and communication theory (94A55) Eulerian and Hamiltonian graphs (05C45)
Cites Work
- Title not available (Why is that?)
- Shift Register Sequences – A Retrospective Account
- A Survey of Full Length Nonlinear Shift Register Cycle Algorithms
- Algorithms for the generation of full-length shift- register sequences
- A Bijective Proof of a Theorem of Knuth
- Title not available (Why is that?)
- On cross joining de Bruijn sequences
- On a Homomorphism of the de Bruijn Graph and its Applications to the Design of Feedback Shift Registers
Cited In (1)
Recommendations
- Switching techniques for edge decompositions of graphs 👍 👎
- Title not available (Why is that?) 👍 👎
- Title not available (Why is that?) 👍 👎
- Title not available (Why is that?) 👍 👎
- Title not available (Why is that?) 👍 👎
- On the numbers of spanning trees and Eulerian tours in generalized de Bruijn graphs 👍 👎
- Spanning trees with constraints on the leaf degree 👍 👎
- Title not available (Why is that?) 👍 👎
- Spanning trees with bounded degrees and leaves 👍 👎
- Branching in digraphs with many and few leaves: structural and algorithmic results 👍 👎
This page was built for publication: On Leaf Node Edge Switchings in Spanning Trees of De Bruijn Graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5114859)
