Results 101 to 110 of about 1,327,272 (305)
Inertias of Laplacian matrices of weighted signed graphs
Special Matrices, 2019 We study the sets of inertias achieved by Laplacian matrices of weighted signed graphs. First we characterize signed graphs with a unique Laplacian inertia.
Monfared K. Hassani +3 more
doaj +1 more source
Identifying Codes with Small Radius in Some Infinite Regular Graphs [PDF]
, 2002 Irène Charon +2 more
openalex +1 more source
An infinite class of Neumaier graphs and non-existence results [PDF]
, 2021 Aida Abiad +4 more
openalex +1 more source
Advanced Engineering Materials, EarlyView.This study reports the fabrication of trabecular bioactive glass scaffolds (composition “1d”: 46.1SiO2‐28.7CaO‐8.8MgO‐6.2P2O5‐5.7CaF2‐4.5Na2O wt%) through vat photopolymerization and the relevant results from mechanical testing and in vivo implantation procedures in rabbit femora, showing great promise for bone tissue engineering applications.
Dilshat Tulyaganov +8 more
wiley +1 more source
Advanced Engineering Materials, EarlyView.An idea of designing novel sensors is proposed by creating appropriate Schottky barriers and vacancies between isomorphous Core‐CuOii/ Shell‐CuOi secondary microspheres and enhancing catalytic and spill‐over effects, and electronegativity via spontaneous biphasic separation, self‐assembly, and trace‐Ni‐doping.
Bala Ismail Adamu +8 more
wiley +1 more source
The incidence chromatic number of some graph
International Journal of Mathematics and Mathematical Sciences, 2005 The concept of the incidence chromatic number of a graph was introduced by Brualdi and Massey (1993). They conjectured that every graph G can be incidence colored with Δ(G)+2 colors.
Liu Xikui, Li Yan
doaj +1 more source
What Do Large Language Models Know About Materials?
Advanced Engineering Materials, EarlyView.If large language models (LLMs) are to be used inside the material discovery and engineering process, they must be benchmarked for the accurateness of intrinsic material knowledge. The current work introduces 1) a reasoning process through the processing–structure–property–performance chain and 2) a tool for benchmarking knowledge of LLMs concerning ...
Adrian Ehrenhofer +2 more
wiley +1 more source
Purely infinite labeled graph $C^*$-algebras [PDF]
, 2017 Ja A Jeong, Eun Ji Kang, Gi Hyun Park
openalex +1 more source
Infinite-Horizon Optimal Control of Switched Boolean Control Networks With Average Cost: An Efficient Graph-Theoretical Approach [PDF]
, 2020 Shuhua Gao +4 more
openalex +1 more source