Results 101 to 110 of about 1,232,284 (259)
Distance majorization sets in graphs
, 2015 Summary: Let \(G=(V,E)\) be a simple graph. A subset \(D\) of \(V(G)\) is said to be a distance majorization set (or dm-set) if for every vertex \(u\in V-D\), there exists a vertex \(v\in D\) such that \(d(u,v)\geq\deg(u)+\deg(v)\). The minimum cardinality of a dm-set is called the distance majorization number of \(G\) (or dm-number of \(G)\) and is ...
R.SUNDARESWARAN, -, V.SWAMİNATHAN, -
openaire +3 more sources
On distances in generalized Sierpiński graphs
Applicable Analysis and Discrete Mathematics, 2018 In this paper we propose formulas for the distance between vertices of a generalized Sierpi?ski graph S(G, t) in terms of the distance between vertices of the base graph G. In particular, we deduce a recursive formula for the distance between an arbitrary vertex and an extreme vertex of S(G, t), and we obtain a recursive formula for the distance ...
Estrada-Moreno, Alejandro +2 more
openaire +4 more sources
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
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
Bounds on separated pairs of subgraphs, eigenvalues and related polynomials [PDF]
We give a bound on the sizes of two sets of vertices at a given minimum distance (a separated pair of subgraphs) in a graph in terms of polynomials and the spectrum of the graph. We find properties of the polynomial optimizing the bound.
Dam, E.R. van
core +1 more source
A Workflow to Accelerate Microstructure‐Sensitive Fatigue Life Predictions
Advanced Engineering Materials, EarlyView.This study introduces a workflow to accelerate predictions of microstructure‐sensitive fatigue life. Results from frameworks with varying levels of simplification are benchmarked against published reference results. The analysis reveals a trade‐off between accuracy and model complexity, offering researchers a practical guide for selecting the optimal ...
Luca Loiodice +2 more
wiley +1 more source
Improved Density Peaks Clustering Based on Shared-Neighbors of Local Cores for Manifold Data Sets
IEEE Access, 2019 A novel clustering algorithm by fast search and find of density peaks (DP) was proposed in Science, 2014. It has attracted much attention from researchers. It can easily select clusters centers with decision graph.
Dongdong Cheng +3 more
doaj +1 more source
Improved Distance Queries in Planar Graphs [PDF]
, 2011 There are several known data structures that answer distance queries between two arbitrary vertices in a planar graph. The tradeoff is among preprocessing time, storage space and query time. In this paper we present three data structures that answer such queries, each with its own advantage over previous data structures.
openaire +2 more sources
Screen‐Printed Flexible Piezoelectric Force Sensor Array with Electromagnetic Interference Shielding
Advanced Engineering Materials, EarlyView.This article introduces a flexible screen‐printed piezoelectric sensor array designed for low‐frequency healthcare applications such as tactile sensing and cardiovascular monitoring. The device integrates interface electronics enabling the simultaneous acquisition of up to 128 signals, along with flexible EMI shielding that significantly reduces noise ...
Joseph Faudou +6 more
wiley +1 more source
Domination Numbers in Graphs Resulting from Shackle Operations with Linkage of any Graph
JTAM (Jurnal Teori dan Aplikasi Matematika)The domination number is the number of dominating nodes in a graph that can dominate the surrounding connected nodes with a minimum number of dominating nodes. This domini number is denoted by γ(G). In this research, we will examine the domination number
Ilham Saifudin +3 more
doaj +1 more source