| Summary: | A two-mode network is a type of network in which nodes can be divided into two sets in such a way that links can be established between different types of nodes. The relationship between two separate sets of entities can be modeled as a bipartite network. In computer networks data is transmitted in form of packets between source to destination. Such packet-switched networks rely on routing protocols to select the best path. Configurations of these protocols depends on the network acquirements; that is why one routing protocol might be efficient for one network and may be inefficient for a other. Because some protocols deal with hop-count (number of nodes in the path) while others deal with distance vector. This paper investigates the minimum transmission in two-mode networks. Based on some parameters, we obtained the minimum transmission between the class of all connected n-nodes in bipartite networks. These parameters are helpful to modify or change the path of a given network. Furthermore, by using least squares fit, we discussed some numerical results of the regression model of the boiling point in benzenoid hydrocarbons. The results show that the correlation of the boiling point in benzenoid hydrocarbons of the first Zagreb eccentricity index gives better result as compare to the correlation of second Zagreb eccentricity index. In case of a connected network, the first Zagreb eccentricity index <inline-formula><math xmlns="http://www.w3.org/1998/Math/MathML" display="inline"><semantics><mrow><msub><mi>ξ</mi><mn>1</mn></msub><mrow><mo>(</mo><mo>ℵ</mo><mo>)</mo></mrow></mrow></semantics></math></inline-formula> is defined as the sum of the square of eccentricities of the nodes, and the second Zagreb eccentricity index <inline-formula><math xmlns="http://www.w3.org/1998/Math/MathML" display="inline"><semantics><mrow><msub><mi>ξ</mi><mn>2</mn></msub><mrow><mo>(</mo><mo>ℵ</mo><mo>)</mo></mrow></mrow></semantics></math></inline-formula> is defined as the sum of the product of eccentricities of the adjacent nodes. This article deals with the minimum transmission with respect to <inline-formula><math xmlns="http://www.w3.org/1998/Math/MathML" display="inline"><semantics><mrow><msub><mi>ξ</mi><mi>i</mi></msub><mrow><mo>(</mo><mo>ℵ</mo><mo>)</mo></mrow></mrow></semantics></math></inline-formula>, for <inline-formula><math xmlns="http://www.w3.org/1998/Math/MathML" display="inline"><semantics><mrow><mi>i</mi><mo>=</mo><mn>1</mn><mo>,</mo><mn>2</mn></mrow></semantics></math></inline-formula> among all <i>n</i>-node extremal bipartite networks with given matching number, diameter, node connectivity and link connectivity.
|
|---|