Bharati RajanIndra RajasinghP. Vasanthi Beulah2026-03-222026-03-22201110.1007/978-3-642-25462-8_40https://doi.org/10.1007/978-3-642-25462-8_40https://andeanlibrary.org/handle/123456789/81242Citaciones: 2enCrossing number (knot theory)Mathematical proofGraphUpper and lower boundsCombinatoricsComputer scienceVery-large-scale integrationMathematicsDiscrete mathematicsOn the Crossing Number of Generalized Fat Treesbook-chapter