On Leaf Node Edge Switchings in Spanning Trees of De Bruijn Graphs

DOI10.1007/978-981-13-0023-3_11MaRDI QIDQ5114859zbMATH OpenOpenAlexFDO

Authors Suman Roy, Srinivasan Krishnaswamy, 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

zbMATH Keywords

de Bruijn sequencesde Bruijn graphshift registerpseudorandom sequence generator

Mathematics Subject Classification ID

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)

Recommendations

• Switching techniques for edge decompositions of graphs
• scientific article; zbMATH DE number 2075817
• A note on leaf-constrained spanning trees in a graph
• On a spanning tree with specified leaves in a bipartite graph
• scientific article; zbMATH DE number 2192218
• On the numbers of spanning trees and Eulerian tours in generalized de Bruijn graphs
• Spanning trees with constraints on the leaf degree
• scientific article; zbMATH DE number 1109399
• Spanning trees with bounded degrees and leaves
• Branching in digraphs with many and few leaves: structural and algorithmic results

Cites work

• scientific article; zbMATH DE number 481378 (Why is no real title available?)
• scientific article; zbMATH DE number 3095523 (Why is no real title available?)
• A Survey of Full Length Nonlinear Shift Register Cycle Algorithms
• A bijective proof of a theorem of Knuth
• Algorithms for the generation of full-length shift- register sequences
• On a Homomorphism of the de Bruijn Graph and its Applications to the Design of Feedback Shift Registers
• On cross joining de Bruijn sequences
• Shift Register Sequences – A Retrospective Account

Cited in

(5)

• scientific article; zbMATH DE number 2192218 (Why is no real title available?)
• Bijections in de Bruijn graphs.
• A simple shift rule for \(k\)-ary de Bruijn sequences
• Mapping prefer-opposite to prefer-one de Bruijn sequences
• An unoriented variation on de Bruijn sequences

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)