One platform for all researcher needs
AI-powered academic writing assistant
Your #1 AI companion for literature search
AI tool for graphics, illustrations, and artwork
Unlock unlimited use of all AI tools with the Editage Plus membership.
Explore Editage Plus
Audio Papers
Ask R Discovery
Translation
Auto-sync
Collaboration
https://doi.org/10.1080/03081087.2018.1543384
Copy DOI
Export
Save
Share
Cite Journal: Linear and Multilinear Algebra |  Publication Date: Nov 13, 2018 |
Affiliation: University of Alberta
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.
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
