Results 101 to 110 of about 832,958 (281)
Shortest Paths in Distance-regular Graphs
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Bendito, Enrique +2 more
openaire +2 more sources
ErB4 and NdB4 nanostructured powders are produced by mechanochemical synthesis. 5 h mechanical alloying and 4 M HCl acid leaching are used in the production. ErB4 and NdB4 powders exhibit maximum magnetization of 0.4726 emu g−1 accompanied with an antiferromagnetic‐to‐paramagnetic phase transition at about TN = 18 K and 0.132 emu g−1 with a maximum at ...
Burçak Boztemur +5 more
wiley +1 more source
The Distance Matrices of Some Graphs Related to Wheel Graphs
Let D denote the distance matrix of a connected graph G. The inertia of D is the triple of integers (n+(D), n0(D), n-(D)), where n+(D), n0(D), and n-(D) denote the number of positive, 0, and negative eigenvalues of D, respectively.
Xiaoling Zhang, Chengyuan Song
doaj +1 more source
Bistable Mechanisms 3D Printing for Mechanically Programmable Vibration Control
This work introduces a 3D‐printed bistable mechanism integrated into tuned mass dampers (TMDs) for mechanically adaptive passive vibration suppression. Through optimized geometry, the bistable design provides adaptable vibration reduction across a broad range of scenarios, achieving effective vibration mitigation without complex controls or external ...
Ali Zolfagharian +4 more
wiley +1 more source
This study investigates laser shock peening for enhancing fatigue performance of riveted aerospace aluminum joints. A comparative approach with cold expansion combines fatigue testing and synchrotron X‐ray methods. Integrating mechanical testing with residual stress and strain characterization provides insights into how different treatments affect the ...
Ogün Baris Tapar +6 more
wiley +1 more source
Minimum Feedback Vertex Sets in Distance Graphs and Circulant Graphs
For a set D⊂ Z n, the distance graph P n (D) has Z n as its vertex set and the edges are between vertices i and j with |i-j|∈D. The circulant graph C n (D) is defined analogously by considering operations modulo n.
Hamamache Kheddouci, Olivier Togni
doaj
Distance majorization sets in graphs
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
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
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

