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 ${\xi }_1(\aleph )$ is defined as the sum of the square of eccentricities of the nodes, and the second Zagreb eccentricity index ${\xi }_2(\aleph )$ is defined as the sum of the product of eccentricities of the adjacent nodes. This article deals with the minimum transmission with respect to ${\xi }_i(\aleph )$, for $i=1,2$ among all n-node extremal bipartite networks with given matching number, diameter, node connectivity and link connectivity.

Graphs give a mathematical model of molecules, and thery are used extensively in chemical investigation. Strategically selections of graph invariants (formerly called "topological indices" or "molecular descriptors") are used in the mathematical modeling of the physio-chemical, pharmacologic, toxicological, and other aspects of chemical compounds. This paper describes a new technique to compute topological indices of two types of chemical networks. Our research examines the mathematical characteristics of molecular descriptors, particularly those that depend on graph degrees. We derive a compact mathematical analysis and neighborhood multiplicative topological indices for product of graphs ($ \mathcal{L} $) and tetrahedral diamond lattices ($ \Omega $). In this paper, the fifth multiplicative Zagreb index, the general fifth multiplicative Zagreb index, the fifth multiplicative hyper-Zagreb index, the fifth multiplicative product connectivity index, the fifth multiplicative sum connectivity index, the fifth multiplicative geometric-arithmetic index, the fifth multiplicative harmonic index and the fifth multiplicative redefined Zagreb index are determined. The comparison study of these topological indices is also discussed.

In \cite{BigAlg-3gen}, an explicit description of bi-quadratic algebras on three generators with PBW basis was obtained. There are four classes: I-IV. The aim of the paper is to study algebras that belong to one of the classes: class II.1. In this class, there are twelve distinct subclasses to consider. The aim of the paper is to study these algebras. In particular, the centre, the primes ideals, the automorphism groups and the normal elements are explicitly described. The Krull, classical Krull, global and Gelfand-Kirillov dimensions of the algebras and their tensor products are computed.