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

<abstract><p>This work considers a discrete-time predator-prey system with a strong Allee effect. The existence and topological classification of the system's possible fixed points are investigated. Furthermore, the existence and direction of period-doubling and Neimark-Sacker bifurcations are explored at the interior fixed point using bifurcation theory and the center manifold theorem. A hybrid control method is used for controlling chaos and bifurcations. Some numerical examples are presented to verify our theoretical findings. Numerical simulations reveal that the discrete model has complex dynamics. Moreover, it is shown that the system with the Allee effect requires a much longer time to reach its interior fixed point.</p></abstract>

Spanning tree (τ ) has an enormous application in computer science and chemistry to determine the geometric and dynamics analysis of compact polymers. In the field of medicines, it is helpful to recognize the epidemiology of hepatitis C virus (HCV) infection. On the other hand, Kemeny's constant (Ω) is a beneficial quantifier characterizing the universal average activities of a Markov chain. This network invariant infers the expressions of the expected number of time-steps required to trace a randomly selected terminus state since a fixed beginning state s i . Levene and Loizou determined that the Kemeny's constant can also be obtained through eigenvalues. Motivated by Levene and Loizou, we deduced the Kemeny's constant and the number of spanning trees of hexagonal ring network by their normalized Laplacian eigenvalues and the coefficients of the characteristic polynomial. Based on the achieved results, entirely results are obtained for the Möbius hexagonal ring network.

<abstract><p>In November 2019, there was the first case of COVID-19 (Coronavirus) recorded, and up to 3$ ^{rd }$ of April 2020, 1,116,643 confirmed positive cases, and around 59,158 dying were recorded. Novel antiviral structures of the SARS-COV-2 virus is discussed in terms of the metric basis of their molecular graph. These structures are named arbidol, chloroquine, hydroxy-chloroquine, thalidomide, and theaflavin. Partition dimension or partition metric basis is a concept in which the whole vertex set of a structure is uniquely identified by developing proper subsets of the entire vertex set and named as partition resolving set. By this concept of vertex-metric resolvability of COVID-19 antiviral drug structures are uniquely identified and helps to study the structural properties of structure.</p></abstract>

<abstract><p>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.</p></abstract>