On the connectivity of the De Bruijn graph

DOI10.1016/0020-0190(88)90219-0zbMath0649.05045OpenAlexW1987535905MaRDI QIDQ1105619

M. A. Sridhar

Publication date: 1988

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0020-0190(88)90219-0

zbMATH Keywords

connectivitystringsstring matchingDe Bruijn graph

Mathematics Subject Classification ID

Connectivity (05C40)

Related Items (2)

An algebraic analysis of the connectivity of De Bruijn and shuffle- exchange digraphs ⋮ Wide diameters of de Bruijn graphs

Cites Work

• Connectivity of Regular Directed Graphs with Small Diameters
• Fault-Tolerant Multiprocessor Link and Bus Network Architectures
• Fault-Tolerant Routing in DeBruijn Comrnunication Networks
• A Survey of Full Length Nonlinear Shift Register Cycle Algorithms
• Fast Pattern Matching in Strings
• On a Homomorphism of the de Bruijn Graph and its Applications to the Design of Feedback Shift Registers

This page was built for publication: On the connectivity of the De Bruijn graph