Results 61 to 70 of about 47,947 (303)
Advanced Engineering Materials, EarlyView.A numerical–experimental framework is developed for characterizing multi‐matrix fiber‐reinforced polymers (MM‐FRPs) combining epoxy and polyurethane matrices. Harmonic bending tests are integrated with finite element model updating (FEMU) to simultaneously identify elastic and viscoelastic material parameters.
Rodrigo M. Dartora +4 more
wiley +1 more source
γ-Cycles And Transitivity By Monochromatic Paths In Arc-Coloured Digraphs
Discussiones Mathematicae Graph Theory, 2013 We call the digraph D an m-coloured digraph if its arcs are coloured with m colours. If D is an m-coloured digraph and a ∈ A(D), colour(a) will denote the colour has been used on a.
Casas-Bautista Enrique +2 more
doaj +1 more source
Paths and cycles in colored graphs [PDF]
Australas. J Comb., 2005 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Broersma, Hajo +3 more
openaire +3 more sources
Advanced Engineering Materials, EarlyView.Geometry‐driven thermal behavior in wire‐arc additive manufacturing (WAAM) influences microstructural evolution during nonequilibrium solidification of a chemically complex Fe–Cr–Nb–W–Mo–C nanocomposite system. By comparing different deposits configurations, distinct entropy–cooling rate correlations, segregation, and carbide evolution are revealed ...
Blanca Palacios +5 more
wiley +1 more source
Enumeration of Paths, Cycles, and Spanning Trees
, 2015 Enumeration of paths, cycles, and spanning trees in ...
Roberto Grossi, GROSSI, ROBERTO
core +1 more source
Finding k Simple Shortest Paths and Cycles [PDF]
, 2016 We present algorithms and techniques for several problems related to finding multiple simple shortest paths and cycles in a graph. Our main result is a new algorithm for finding k simple shortest paths for all pairs of vertices in a weighted directed ...
Agarwal, Udit, Ramachandran, Vijaya
core +1 more source
Conjectures About Wheels Without One Edge with Paths and Cycles
MathematicsThe crossing number cr(G) of a graph G is the minimum number of edge crossings over all drawings of G in the plane. The main aim of this paper is to give the crossing numbers of the join products G*+Pn and G*+Cn for the connected graph G* obtained by ...
Michal Staš, Mária Timková
doaj +1 more source
Analysis of Known Linear Distributed Average Consensus Algorithms on Cycles and Paths
Sensors, 2018 In this paper, we compare six known linear distributed average consensus algorithms on a sensor network in terms of convergence time (and therefore, in terms of the number of transmissions required).
Jesús Gutiérrez-Gutiérrez +2 more
doaj +1 more source
Optimal gossiping in paths and cycles
Journal of Discrete Algorithms, 2003 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Lau, FCM, Zhang, SH
openaire +3 more sources
Advanced Engineering Materials, EarlyView.Additive manufacturing provides precise control over the placement of continuous fibres within polymer matrices, enabling customised mechanical performance in composite components. This article explores processing strategies, mechanical testing, and modelling approaches for additive manufactured continuous fibre‐reinforced composites.
Cherian Thomas, Amir Hosein Sakhaei
wiley +1 more source