Results 61 to 70 of about 1,679,013 (321)
By combining porous, solid, and carbon fiber‐reinforced thermoplastic polyurethane within a single 3D printed honeycomb structure, this current work achieved precise control over spatial stiffness while ensuring strong interlayer adhesion. The findings demonstrate enhanced energy absorption and densification strain, outperforming traditional uniform ...
Savvas Koltsakidis +2 more
wiley +1 more source
Reflexive polytopes arising from perfect graphs
Reflexive polytopes form one of the distinguished classes of lattice polytopes. Especially reflexive polytopes which possess the integer decomposition property are of interest.
Hibi, Takayuki, Tsuchiya, Akiyoshi
core +1 more source
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
A sharp lower bound on the signless Laplacian index of graphs with (κ,τ)-regular sets
A new lower bound on the largest eigenvalue of the signless Laplacian spectra for graphs with at least one (κ,τ)regular set is introduced and applied to the recognition of non-Hamiltonian graphs or graphs without a perfect matching.
Andeelić Milica +2 more
doaj +1 more source
Perfect Matchings in Random Octagonal Chain Graphs
A perfect matching of a (molecule) graph G is a set of independent edges covering all vertices in G. In this paper, we establish a simple formula for the expected value of the number of perfect matchings in random octagonal chain graphs and present the ...
Shouliu Wei +4 more
doaj +1 more source
Cyclewidth and the Grid Theorem for Perfect Matching Width of Bipartite Graphs [PDF]
A connected graph G is called matching covered if every edge of G is contained in a perfect matching. Perfect matching width is a width parameter for matching covered graphs based on a branch decomposition.
Meike Hatzel +2 more
semanticscholar +1 more source
PBTTT‐OR‐R, a C14‐alkoxy/alkyl‐PBTTT polymer derivative, is of substantial interest for optoelectronics due to its specific fullerene intercalation behavior and enhanced charge‐transfer absorption. Comparing this polymer with (S) and without (O) homocoupling defects reveals that PBTTT‐OR‐R(O) forms stable co‐crystals with PC61BM, while PBTTT‐OR‐R(S ...
Zhen Liu +14 more
wiley +1 more source
OPEN PACKING NUMBER FOR SOME CLASSES OF PERFECT GRAPHS
Let \(G\) be a graph with the vertex set \(V(G)\). A subset \(S\) of \(V(G)\) is an open packing set of \(G\) if every pair of vertices in \(S\) has no common neighbor in \(G.\) The maximum cardinality of an open packing set of \(G\) is the open ...
K. Raja Chandrasekar, S. Saravanakumar
doaj +1 more source
Perfect matchings in inhomogeneous random bipartite graphs in random environment
In this note we study inhomogeneous random bipartite graphs in random environment. These graphs can be thought of as an extension of the classical Erd\H os-R\'enyi random bipartite graphs in a random environment.
Jairo Bochi +2 more
doaj +1 more source
Wearable Haptic Feedback Interfaces for Augmenting Human Touch
The wearable haptic feedback interfaces enhance user experience in gaming, social media, biomedical instrumentation, and robotics by generating tactile sensations. This review discusses and categorizes current haptic feedback interfaces into force, thermal, and electrotactile stimulation‐based haptic feedback interfaces, elucidating their current ...
Shubham Patel +3 more
wiley +1 more source

