Results 121 to 130 of about 177,806 (308)

Productivity‐Driven Optimization of Laser Powder Bed Fusion Parameters for IN718 Superalloy: Process Control, Microstructure, and Mechanical Properties

open access: yesAdvanced Engineering Materials, EarlyView.
This study demonstrates how optimizing laser power, scanning speed, and hatching distance in laser powder bed fusion can boost the productivity of Inconel 718 manufacturing by up to 29% while maintaining mechanical integrity. The work delivers a validated process window and cost–time analysis, offering industry‐ready guidelines for efficient additive ...
Amir Behjat   +7 more
wiley   +1 more source

Regular graphs with four eigenvalues

open access: yes
We study the connected regular graphs with four distinct eigenvalues. Properties and feasibility conditions of the eigenvalues are found. Several examples, constructions and characterizations are given, as well as some uniqueness and nonexistence results.
Dam, E.R. van
core   +2 more sources

Graphs with distance guarantees. [PDF]

open access: yes, 1999
One goal in network design is the construction of sparse networks that guarantee short distances with respect to some given distance requirements. By this, it can be guaranteed, for example, that delays that are incurred by link faults are bounded. An appropriate graph-theoretic model for this is the concept of k-spanners: Given a graph G, a k-spanner ...
openaire   +2 more sources

A Knowledge‐Based Approach for Understanding and Managing Additive Manufacturing Data

open access: yesAdvanced Engineering Materials, EarlyView.
Additive manufacturing processes generate a large amount of data. Effectively managing, understanding, and retrieving information from this data remains a major challenge. Therefore, we propose an ontology‐based approach to integrate heterogeneous data, enable semantic queries, and support decision‐making.
Mina Abd Nikooie Pour   +5 more
wiley   +1 more source

Spectral Characterization of the Hamming Graphs

open access: yes
We show that the Hamming graph H(3; q) with diameter three is uniquely determined by its spectrum for q ¸ 36. Moreover, we show that for given integer D ¸ 2, any graph cospectral with the Hamming graph H(D; q) is locally the disjoint union of D copies of
Koolen, J.H., Bang, S., Dam, E.R. van
core  

Affecting the Properties of Copper–Graphene Electroconductive Composite by Severe Plastic Deformation

open access: yesAdvanced Engineering Materials, EarlyView.
Copper‐based composites enhanced with carbon feature convenient mechanical properties and favorable electric conductivity. Processing via deformation and thermomechanical treatments can introduce advantageous microstructures further enhancing their performance. Herein, copper–graphene powder‐based composites are directly consolidated via rotary swaging
Radim Kocich   +3 more
wiley   +1 more source

Hamiltonian Strongly Regular Graphs

open access: yes
We give a sufficient condition for a distance-regular graph to be Hamiltonian. In particular, the Petersen graph is the only connected non-Hamiltonian strongly regular graph on fewer than 99 vertices.Distance-regular graphs;Hamilton cycles JEL ...
Brouwer, A.E., Haemers, W.H.
core  

Fostering Innovation: Streamlining Magnetocaloric Materials Research by Digitalization

open access: yesAdvanced Engineering Materials, EarlyView.
Magnetocaloric cooling (MCE) is an environmentally friendly refrigeration method with great potential. Optimizing MCE materials involves the preparation and screening of large quantities of samples, which in turn generates a large amount of data. A digitalization approach is presented that uses ontologies, knowledge graphs, and digital workflows to ...
Simon Bekemeier   +17 more
wiley   +1 more source

Degree distance and Gutman index of corona product of graphs [PDF]

open access: yesTransactions on Combinatorics, 2015
In this paper, the degree distance and the Gutman index of the corona product of two graphs are determined. Using the results obtained, the exact degree distance and Gutman index of certain classes of graphs are computed.
V. Sheeba Agnes
doaj  

Home - About - Disclaimer - Privacy