There are three different kinds of topological indices: spectrum-based, degree-based, and distance-based. We presented the \(K\)-swapped network for \(t\)-regular graphs in this study. We also computed various degree-based topological indices of the \(K\)-swapped network for \(t\)-regular graphs, eye, and \(n\)-dimensional twisted cube network. The metrics used to analyze the abstract structural characteristics of networks are called topological indices. We also calculate each of the aforementioned networks M-polynomials. A graph can be used to depict an interconnection network’s structure. The processing nodes in the network are represented by vertices, while the links connecting the processor nodes are represented by edges. We can quickly determine the diameter and degree between the nodes based on the graph’s tpology. A key component of graph theory are graph invariants, which identify the structural characteristics of networks and graphs. Furthermore doescribed by graph invariants are computer, social, and internet networks.

Shadi I.K et al. [1] introduced the edge hub number of graphs. This work extends the concept to fuzzy graphs. We derive several properties of edge hub number of fuzzy graphs and establish some relations that connect the new parameter with other fuzzy graph parameters. Also, some bounds of such a parameter are investigated. Moreover, we provide empirical evidence examples to elucidate the behavior and implications of edge hub number of fuzzy graph parameters.

In this paper, we give a relationship between the covering number of a simple graph \(G\), \(\beta(G)\), and a new parameter associated to \(G\), which is called 2-degree-packing number of \(G\), \(\nu_2(G)\). We prove that \[\lceil \nu_{2}(G)/2\rceil\leq\beta(G)\leq\nu_2(G)-1,\] for any simple graph \(G\), with \(|E(G)|>\nu_2(G)\). Also, we give a characterization of connected graphs that attain the equalities.

Let \(A\) and \(B\) be two graph and \(P(A,z)\) and \(P(B,z)\) are their chromatic polynomial, respectively. The two graphs \(A\) and \(B\) are said to be chromatic equivalent denoted by \( A \sim B \) if \(P(A,z)=P(B,z)\). A graph \(A\) is said to be chromatically unique(or simply \(\chi\)- unique) if for any graph \(B\) such that \(A\sim B \), we have \(A\cong B\), that is \(A\) is isomorphic to \(B\). In this paper, the chromatic uniqueness of a new family of \(6\)-bridge graph \(\theta(r,r,s,s,t,u)\) where \(2\leq r\leq s \leq t\leq u\) is investigated.

This corrigenda makes seven corrections to D. Raske, “The Galerkin method and hinged beam dynamics,” Open J. of Math. Sci. 2023, 7, 236-247.

This paper gives sufficient conditions for the existence of positive periodic solutions to general indefinite singular differential equations. Furthermore, under some assumptions we show the existence of two positive periodic solutions. The methods used are Krasnoselski\(\breve{\mbox{i}}\)’s-Guo fixed point theorem and the positivity of the associated Green’s function.

Fusion frames and subfusion frames are generalizations of frames in the Hilbert spaces. In this paper, we study subfusion frames and the relations between the fusion frames and subfusion frame operators. Also, we introduce new construction of subfusion frames. In particular, we study atomic resolution of the identity on the Hilbert spaces and derive new results.

In this work, a new class of bi-univalent functions \(I^{n+1}_{\Gamma_m,\lambda}(x,z)\) is defined by means of subordination. Upper bounds for some initial coefficients and the Fekete-Szegö functional of functions in the new class were obtained.

This work is a generalization of Ostrowski type integral inequalities using
a special 4-step quadratic kernel. Some new and useful results are obtained.
Applications to Quadrature Rules and special Probability distribution are
also evaluated.

In this work, we establish the existence and uniqueness of solution of Floquet eigenvalue and its adjoint to homogeneous growth-fragmentation equation with positive and periodic coefficients. We study the Floquet exponent, which measures the growth rate of a population. Finally, we establish the long term behavior of solution to the homogeneous growth-fragmentation equation by entropy method [1,2,3].