A class of ball-and-bin problems and its application to mesh networks
Hamid Sarbazi‐Azad, Ahmad Khonsari · 2004
Non-recursive and explicit expressions for calculating the number of ways to distribute n indistinguishable balls into m distinguishable bins with different capacities have been derived. Similar expression for the special case where bins have the same capacity was previously reported in the literature. Theses expressions can be used to study network graphs with grid structures. In this line, we have derived some topological properties of meshes, furnishing some expressions to calculate the surface area and volume of radial spheres in the mesh network.