Results 111 to 120 of about 2,858,268 (305)

Thermodynamic Pathways of Nonequilibrium Solidification in Wire‐Arc Additive Manufacturing Fe‐Based Multicomponent Alloy Structures

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, Anthony Gonzalez, Aleksander Aleman, Tyler Dolmetsch, Tanaji Paul, Arvind Agarwal   +5 more
wiley   +1 more source

On the Eigenvalue Spectrum of Cayley Graphs: Connections to Group Structure and Expander Properties

Mathematics
Cayley graphs sit at the intersection of algebra, geometry, and theoretical computer science. Their spectra encode fine structural information about both the underlying group and the graph itself.
Mohamed A. Abd Elgawad, Junaid Nisar, Salem A. Alyami, Mdi Begum Jeelani, Qasem Al-Mdallal   +4 more
doaj   +1 more source

On energy, Laplacian energy and $p$-fold graphs

Electronic Journal of Graph Theory and Applications, 2015
For a graph $G$ having adjacency spectrum ($A$-spectrum) $\lambda_n\leq\lambda_{n-1}\leq\cdots\leq\lambda_1$ and Laplacian spectrum ($L$-spectrum) $0=\mu_n\leq\mu_{n-1}\leq\cdots\leq\mu_1$, the energy is defined as $ E(G)=\sum_{i=1}^{n}|\lambda_i|$ and ...
Hilal A Ganie, Shariefuddin Pirzada, Edy Tri Baskoro   +2 more
doaj   +1 more source

A matrix representation of graphs and its spectrum as a graph invariant

, 2006
We use the line digraph construction to associate an orthogonal matrix with each graph. From this orthogonal matrix, we derive two further matrices. The spectrum of each of these three matrices is considered as a graph invariant. For the first two cases,
Emms, David, Hancock, Edwin R., Severini, Simone, Wilson, Richard C.   +3 more
core   +2 more sources

Mixed Graphs Determined by their Generalized Hermitian Adjacency Spectrum Based on Eisenstein Integers

The Electronic Journal of Combinatorics
A mixed graph is a graph obtained from a simple undirected graph by orientating a subset of edges. In 2020, Mohar introduced a new kind of Hermitian adjacency matrix (called Eisenstein adjacency matrix) of a mixed graph using a primitive sixth root of unity, which has some advantages over the one proposed by Guo and Mohar in 2017, and independently by ...
Ji, Yizhe, Wang, Wei, Wang, Wei, Zhang, Hao   +3 more
openaire   +1 more source

Al–Cu Composite Casting of Laser‐Deoxidized Copper: Bonding, Interfacial Chemistry, and Thermal Conductivity

Advanced Engineering Materials, EarlyView.
This study investigates laser‐based oxide removal of Cu inserts in oxygen‐free conditions and examines long‐term oxidation kinetics and surface chemistry under different atmospheres via X‐ray photoelectron spectroscopy. Al–Cu compound casting with differently oxidized surfaces is performed, and intermetallic phase formation, morphology, and thermal ...
Timon Steinhoff, Finn‐Lennard Janthur, Sascha Zimmermann, Sarah Seffer, Jörg Hermsdorf, René Gustus, Ludger Overmeyer, Wolfgang Maus‐Friedrichs, Hans Jürgen Maier, Christian Klose   +9 more
wiley   +1 more source

Additive Manufacturing of Continuous Fibre Reinforced Composites: Process, Characterisation, Modelling, and Sustainability

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

Signless Laplacian determinations of some graphs with independent edges

Karpatsʹkì Matematičnì Publìkacìï, 2018
Let $G$ be a simple undirected graph. Then the signless Laplacian matrix of $G$ is defined as $D_G + A_G$ in which $D_G$ and $A_G$ denote the degree matrix and the adjacency matrix of $G$, respectively.
R. Sharafdini, A.Z. Abdian
doaj   +1 more source

On structural properties and adjacency spectrum of coprime graph of integers

Asian-European Journal of Mathematics
Let [Formula: see text] denote the coprime graph having vertex set [Formula: see text] with any two vertices [Formula: see text] being adjacent if and only if [Formula: see text]. In this paper, we first study some structural properties of [Formula: see text]. We study the vertex connectivity and crossing number of the coprime graph of integers.
openaire   +2 more sources

Multimodal Data‐Driven Microstructure Characterization

Advanced Engineering Materials, EarlyView.
A self‐consistent autonomous workflow for EBSP‐based microstructure segmentation by integrating PCA, GMM clustering, and cNMF with information‐theoretic parameter selection, requiring no user input. An optimal ROI size related to characteristic grain size is identified.
Qi Zhang, Santiago Benito, Özge Özgün, Sebastian Weber, Markus Stricker   +4 more
wiley   +1 more source