Results 101 to 110 of about 113,956 (308)

Enhancing the Age‐Hardening Response of Laser Powder‐Bed Fusion WE43 Alloy through Microstructural Control

open access: yesAdvanced Engineering Materials, EarlyView.
Laser powder‐bed fusion (L‐PBF) can produce dense WE43 magnesium alloy parts, but their mechanical properties are limited by a nonhomogeneous microstructure. This study investigates the effects of varying direct aging (T5) and artificial age‐hardening (T6) conditions on microstructure and strength. Optimized T6 treatment significantly improves strength
Prathviraj Upadhyaya   +5 more
wiley   +1 more source

A New Perspective on the Average Mixing Matrix

open access: yes, 2017
We consider the continuous-time quantum walk defined on the adjacency matrix of a graph. At each instant, the walk defines a mixing matrix which is doubly-stochastic. The average of the mixing matrices contains relevant information about the quantum walk
Coutinho, Gabriel   +3 more
core  

Effect of Water Aging on the Mechanical Properties of Hybrid Carbon/Aramid Reinforced Thermoplastic Composites

open access: yesAdvanced Engineering Materials, EarlyView.
This study investigates the mechanical properties of Carbon/Aramid intraply hybrid fiber‐reinforced Elium composites under 6 months of water aging. After aging, flexural strength decreases by 25.89%, tensile strength by 4.40%, and fracture toughness by 21.56%.
Muhammed Huseyin Guzel, Gurol Onal
wiley   +1 more source

γ-Inverse graph of some mixed graphs

open access: yesSpecial Matrices
Let GG be a graph. Then, the inverse graph G−1{G}^{-1} of GG is defined to be a graph that has adjacency matrix similar to the inverse of the adjacency matrix of GG, where the similarity matrix is ±1\pm 1 diagonal matrix. In this article, we introduced a
Boulahmar Wafa   +2 more
doaj   +1 more source

The adjacency spectrum of two new operations of graphs

open access: yesAKCE International Journal of Graphs and Combinatorics, 2018
Let be a graph and be its adjacency matrix. The eigenvalues of are the eigenvalues of and form the adjacency spectrum, denoted by . In this paper, we introduce two new operations and , and describe the adjacency spectra of and of regular graphs , and ...
Dijian Wang, Yaoping Hou, Zikai Tang
doaj   +1 more source

Evaluating adjacency matrix for network visualization

open access: yes, 2021
Adjacency Matrix (AM) is one of the commonly used techniques to visualize networks. While an AM provides a clean and compact representation for dense networks, several studies have shown that it is not suitable for path-related tasks. Several visualization techniques have been proposed to address this limitation.
openaire   +2 more sources

On the mixed adjacency matrix of a mixed graph

open access: yesLinear Algebra and its Applications, 2016
A mixed graph is a graph with edges and arcs, which can be considered as a hybrid of an undirected graph and a directed graph. In this paper we define the mixed adjacency matrix and the mixed energy of a mixed graph. The mixed adjacency matrix generalizes both the adjacency matrix of an undirected graph and the skew-adjacency matrix of a digraph.
Adiga, Chandrashekar   +2 more
openaire   +3 more sources

Shape Memory Polymer‐Based Hook‐and‐Loop Fastener for Robust Bonding and on‐Demand Easy Separation

open access: yesAdvanced Engineering Materials, EarlyView.
A 3D shape memory polymer‐based hook‐and‐loop fastener, fabricated using projection microstereolithography and molding, offers tunable bonding strength through temperature control. When heated from 25 to 70 °C, the fastener softens and deforms easily, reducing bonding strength by 20‐fold for on‐demand easy separation.
Chen Yang   +5 more
wiley   +1 more source

Home - About - Disclaimer - Privacy