Results 61 to 70 of about 2,382 (198)

Generative Models in Inorganic Crystals Discovery and Inverse Design

ENERGY &ENVIRONMENTAL MATERIALS, EarlyView.
Generative inverse‐design samples from the vast inorganic crystal design space by starting from target properties such as band gap, stability, and ion transport. This Review examines the representations, generative models, and validation workflows needed to translate candidate structures into stable, potentially synthesizable materials for applications
Tao Li, Xiaolin Liu, Fei Wang, Yan Xiong, Yu Chen, Yan Zhao   +5 more
wiley   +1 more source

On the Variability of Results for Cylinder Flow: A Systematic Analysis of Parameter Sensitivity Within the Lattice Boltzmann Method

International Journal for Numerical Methods in Fluids, EarlyView.
This study systematically investigates the variability of cylinder flow results. We provide a comprehensive overview of literature values and, using the lattice Boltzmann method (LBM), show that insufficient convergence studies and variations in simulation parameters are a plausible cause for the significant spread in data.
Maximilian Bille, Mario C. Bedrunka, Philipp Spelten, Holger Foysi, Dirk Reith   +4 more
wiley   +1 more source

On Total Domination in the Cartesian Product of Graphs

Discussiones Mathematicae Graph Theory, 2018
Ho proved in [A note on the total domination number, Util. Math. 77 (2008) 97–100] that the total domination number of the Cartesian product of any two graphs without isolated vertices is at least one half of the product of their total domination numbers.
Brešar Boštjan, Hartinger Tatiana Romina, Kos Tim, Milanič Martin   +3 more
doaj   +1 more source

Autonomous Velocity Encoding (VENC) Selection Improves Precision of Quantitative Flow Measurement

Journal of Magnetic Resonance Imaging, EarlyView.
ABSTRACT Background The optimal velocity encoding limit (VENC) in phase contrast MRI is subject‐specific because it depends on peak flow rate and the presence of flow jets. Currently, VENC is set manually with limited prior knowledge of the peak velocity. Setting the correct VENC might improve measurement precision or shorten scan times.
Pierre Daudé, Rajiv Ramasawmy, Christine Mancini, Dominique Franson, Sunggun Lee, Anastasia Tsakirellis, W. Patricia Bandettini, Ahsan Javed, Kelvin Chow, Adrienne E. Campbell‐Washburn   +9 more
wiley   +1 more source

Fault Detection of Electric Motors via Symmetrized Dot Pattern‐Based Features

International Journal of Mechanical System Dynamics, EarlyView.
ABSTRACT This study proposes a novel symmetrized dot pattern (SDP) approach using designed SDP‐based features, extracted from transformed vibration signals, for fault detection. These features describe the compactness, inclination, and shape of the “snowflake” diagram distributions.
Mario Spirto, Pierangelo Malfi, Armando Nicolella, Francesco Melluso, Chiara Cosenza, Sergio Savino, Vincenzo Niola   +6 more
wiley   +1 more source

Monotone Chromatic Number of Graphs

International Journal of Analysis and Applications, 2020
For a graph G = (V, E), a vertex coloring (or, simply, a coloring) of G is a function C: V (G) → {1, 2, ..., k} (using the non-negative integers {1, 2, ..., k} as colors).
Anwar Saleh, Najat Muthana, Wafa Al-Shammakh, Hanaa Alashwali   +3 more
doaj  

A Class of Graphs Approaching Vizing's Conjecture

Theory and Applications of Graphs, 2016
For any graph G=(V,E), a subset S of V dominates G if all vertices are contained in the closed neighborhood of S, that is N[S]=V. The minimum cardinality over all such S is called the domination number, written γ(G). In 1963, V.G. Vizing conjectured that
Aziz Contractor, Elliot Krop
doaj   +1 more source

Fault‐Tolerant Mutual‐Visibility: Complexity and Solutions for Grid‐Like Networks

Networks, EarlyView.
ABSTRACT Networks are often modeled using graphs, and within this setting we introduce the notion of k$$ k $$‐fault‐tolerant mutual visibility. Informally, a set of vertices X⊆V(G)$$ X\subseteq V(G) $$ in a graph G$$ G $$ is a k$$ k $$‐fault‐tolerant mutual‐visibility set (k$$ k $$‐ftmv set) if any two non‐adjacent vertices in X$$ X $$ are connected by
Serafino Cicerone, Gabriele Di Stefano, Sandi Klavžar, Gang Zhang   +3 more
wiley   +1 more source

The irregularity of graphs under graph operations

Discussiones Mathematicae Graph Theory, 2014
The irregularity of a simple undirected graph G was defined by Albertson [5] as irr(G) = ∑uv∈E(G) |dG(u) − dG(v)|, where dG(u) denotes the degree of a vertex u ∈ V (G).
Abdo Hosam, Dimitrov Darko
doaj   +1 more source

The Cartesian Product and Join Graphs on Edge-Version Atom-Bond Connectivity and Geometric Arithmetic Indices

Molecules, 2018
The Cartesian product and join are two classical operations in graphs. Let dL(G)(e) be the degree of a vertex e in line graph L(G) of a graph G. The edge versions of atom-bond connectivity (ABCe) and geometric arithmetic (GAe) indices of G are defined as
Xiujun Zhang, Huiqin Jiang, Jia-Bao Liu, Zehui Shao   +3 more
doaj   +1 more source