Abstract
ABSTRACT For some families of distance-regular graphs such as strongly regular graphs, Johnson graphs, cocktail-party graphs, and Hamming graphs, we give a polynomial-time construction of spanning trees of maximum degree that are thin trees under some mild assumptions on the parameters of the graph.
Full Text 
Sign-in/Register to access full text options
Sign-in/Register to access full text options 
Published version (
Free)
Free) 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
