Results 101 to 110 of about 3,558 (256)

Radiation‐Absorptive Heat Transport in Buoyancy‐Driven MHD Nanofluids Flow With Cross‐Diffusion and Chemical Interaction Effects Over a Vertical Moving Plate

open access: yesAsia-Pacific Journal of Chemical Engineering, EarlyView.
ABSTRACT This article investigates the Soret–Dufour cross‐diffusion effects on radiation‐absorptive unsteady free‐convection of magnetized nanofluids (TiO2–water$$ {\mathrm{TiO}}_2\hbox{--} \mathrm{water} $$ and Cu–water$$ \mathrm{Cu}\hbox{--} \mathrm{water} $$) flow over a vertical moving permeable plate.
B. Prabhakar Reddy   +2 more
wiley   +1 more source

The edge geodetic number and Cartesian product of graphs [PDF]

open access: yes, 2010
For a nontrivial connected graph G = (V(G),E(G)), a set S⊆ V(G) is called an edge geodetic set of G if every edge of G is contained in a geodesic joining some pair of vertices in S.
Santhakumaran, A., Ullas Chandran, S.
core   +1 more source

Constructing Node-Disjoint Routes in K-Ary N-Cubes

open access: yesSultan Qaboos University Journal for Science, 1997
In this paper, a method for constructing node-disjoint (parallel) paths in k-ary n-cube interconnection networks is described. We start by showing in general how to construct parallel paths in any Cartesian product of two graphs based on known paths in ...
Khaled Day, Abdel Elah Al-Ayyoub
doaj   +1 more source

Retract rigid cartesian products of graphs

open access: yesDiscrete Mathematics, 1988
A graph H is defined to be a retract of the graph G if there are edge- preserving maps \(f: V(H)\to V(G)\) and \(g: V(G)\to V(H)\) such that \(g(f(v))=v,\) for each \(v\in V(G)\) \((''v\in V(G)''\) appears in the paper, but \(''v\in V(H)''\) is correct). Thus H can be regarded as a subgraph of G.
Richard J. Nowakowski, Ivan Rival
openaire   +2 more sources

Functional models from limited data: A parametric and multimodal approach to anatomy and 3D kinematics of feeding in basking sharks (Cetorhinus maximus)

open access: yesThe Anatomical Record, EarlyView.
Abstract Basking sharks, Cetorhinus maximus (Gunnerus, Brugden [Squalus maximus], Det Kongelige Norske Videnskabers Selskabs Skrifter, 1765, vol. 3, pp. 33–49), feed by gaping their mouths and gill slits, greatly reorienting their cranial skeletons to filter food from water.
Tairan Li   +12 more
wiley   +1 more source

Craniofacial growth, modeling, and estimation of milestones

open access: yesThe Anatomical Record, EarlyView.
Abstract Understanding craniofacial growth is foundational for research into intra‐ and interspecies variation, evolution, and clinical care. The Craniofacial Growth Consortium Study (CGCS), combines cephalographs from historical growth studies to create a dense longitudinal record of growth from 6 to 22 years of age.
Richard J. Sherwood   +6 more
wiley   +1 more source

Dispersion on Certain Cartesian Products of Graphs

open access: yes, 2023
In this short note we prove a sharp dispersive estimate $\|\mathrm{e}^{\mathrm{i} tH} f\|_\infty < t^{-d/3}\|f\|_1$ for any Cartesian product $\mathbb{Z}^d\mathop\square G_F$ of the integer lattice and a finite graph. This includes the infinite ladder, $k$-strips and infinite cylinders, which can be endowed with certain potentials.
Ammari, Kaïs, Sabri, Mostafa
openaire   +2 more sources

Machine Learning Paradigm for Advanced Battery Electrolyte Development

open access: yesCarbon Energy, EarlyView.
Electrolyte materials determine ion transport kinetics within the bulk and interphases, ultimately influencing the performance of battery systems. As data‐driven paradigms increasingly reshape materials discovery, this review provides an application‐oriented exploration of the intersection between machine learning and electrolyte science. By evaluating
Chang Su   +4 more
wiley   +1 more source

The Well-Covered Dimension Of Products Of Graphs

open access: yesDiscussiones Mathematicae Graph Theory, 2014
We discuss how to find the well-covered dimension of a graph that is the Cartesian product of paths, cycles, complete graphs, and other simple graphs. Also, a bound for the well-covered dimension of Kn × G is found, provided that G has a largest greedy ...
Birnbaum Isaac   +4 more
doaj   +1 more source

A Geometric Characterization of Steady Laminar Flow

open access: yesCommunications on Pure and Applied Mathematics, EarlyView.
ABSTRACT We study the steady states of the Euler equations on the periodic channel or annulus. We show that if these flows are laminar (layered by closed non‐contractible streamlines which foliate the domain), then they must be either parallel or circular flows.
Theodore D. Drivas, Marc Nualart
wiley   +1 more source

Home - About - Disclaimer - Privacy