Thin trees in some families of distance-regular graphs

DOI10.1080/03081087.2018.1543384zbMath1460.05202OpenAlexW2900807648WikidataQ114641347 ScholiaQ114641347MaRDI QIDQ4965921

Ramin Mousavi

Publication date: 18 March 2021

Published in: Linear and Multilinear Algebra (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/03081087.2018.1543384

zbMATH Keywords

algorithmeffective resistancedistance-regularthin trees

Mathematics Subject Classification ID

Association schemes, strongly regular graphs (05E30) Distance in graphs (05C12)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• The weak 3-flow conjecture and the weak circular flow conjecture
• Eigenvalues and perfect matchings
• On electric resistances for distance-regular graphs
• Connectivity, toughness, spanning trees of bounded degree, and the spectrum of regular graphs
• A constant-factor approximation algorithm for the asymmetric traveling salesman problem
• Pipage Rounding, Pessimistic Estimators and Matrix Concentration
• Approximating Minimum Bounded Degree Spanning Trees to within One of Optimal

This page was built for publication: Thin trees in some families of distance-regular graphs