Entesar Mohamed El-Kholy and H. Ahmed
In this paper we examining the relation between graph folding of a given graph and folding of new graphs obtained from this graph by some techniques like dual, gear, subdivision, web, crown, simplex, crossed prism and clique sum graphs. In each case, we obtained the necessary and sufficient conditions, if exist, for these new graphs to be folded. A simplex graph κ (G ) of an undirected graph G is itself a graph with a vertex for each clique in G . Two vertices of κ (G ) are joined by an edge whenever the corresponding two cliques differ in the presence or absence of a single vertex. The single vertices are called the zero vertices
Ayele Tulu and Wubshet Ibrahim
In this paper, the problem of unsteady two-dimensional mixed convection heat, mass transfer flow of nanofluid past a moving wedge embedded in porous media is considered. The effects of nanoparticle volume fraction, thermal radiation, viscous dissipation, chemical reaction, and convective boundary condition are studied. The physical problem is modeled using partial differential equations. The transformed dimensionless system of coupled nonlinear ordinary differential equations is then solved numerically using Spectral Quasi Linearization Method (SQLM). Effects of various parameters on velocity, temperature and concentration distributions as well as skin friction coefficient, local Nusselt number and local Sherwood number are shown using table and graphical representations. The results reveal that the nano fluid velocity and temperature profiles reduce with increasing the values of nanoparticle volume fraction. Greater values of temperature and concentration distributions are observed in the steady flow than unsteady flow. The skin friction coefficient and local Sherwood number are increasing functions while the local Nusselt number is a decreasing function of nanoparticle volume fraction, permeability parameter, Eckert number, Dufour number, and Soret number. The obtained solutions are checked against the previously published results and a very good agreement have been obtained.
DOI: 10.37421/2168-9679.2023.12.549
DOI: 10.37421/2168-9679.2023.12.550
DOI: 10.37421/2168-9679.2024.13.569
Integrating high-dimensional data is a crucial challenge in modern computational science. As we generate and collect vast amounts of data from diverse sources, the complexity of this task increases exponentially. High-dimensional data sets are characterized by a large number of variables, which often surpass the number of observations. This disparity creates difficulties in data analysis, as traditional statistical methods tend to falter under such conditions. To address these challenges, adaptive algorithms have emerged as powerful tools, offering a computational approach to effectively integrate and analyze high-dimensional data.
Adaptive algorithms are designed to adjust their parameters and structures based on the characteristics of the data they process. This flexibility makes them particularly well-suited for handling high-dimensional data, where the relationships between variables are often complex and not easily discernible. These algorithms are capable of learning and evolving as they interact with the data, allowing for more accurate modeling and integration of high-dimensional datasets.
Mojammel Haque*, Most Halimatuj Sadia and Laek Sazzad Andallah
DOI: 10.37421/2168-9679.2024.13.579
In our modern era, traffic congestion in big cities has become threat for our daily life. It is one of the greatest problems in many developed countries of the world like Bangladesh. Various mathematical models have been employed to address the issue of traffic congestion. Traffic flow models assume that density and velocity are related. Bruce Greenshields first introduced traffic density-velocity connection. In this paper, we would like to study with linear velocity density relationship (Greenshields Model) and exponential velocity density relationship (Underwood Model) using the model for the flow of traffic based on diffusion. To make a comparative study between Greenshields and Underwood Models we solve the traffic flow model of the diffusion type as analytically as well as numerically. Due to analytical solution complexity, we use the finite difference method to solve the model numerically. We use explicit upwind, explicit centered, and explicit Lax-Wendrooff schemes to solve the model numerically. For each of the schemes, we present a comparison between linear and exponential velocity-density relationships. From this comparison, we can say that the exponential velocity- density relationship is appropriate to overcome the traffic congestion problem for each of the schemes.
Jerich Grillo*
Jerich Grillo*
Kaili Rimfeld*
Rustam Mardanov*
Andrew Lunasin*
Journal of Applied & Computational Mathematics received 1282 citations as per Google Scholar report
Spanish 
Chinese 
Russian 
German 
French 
Japanese 
Portuguese 
Hindi 