Results 71 to 80 of about 64,086 (307)
Advanced Engineering Materials, EarlyView.The present study investigates recycling of NiTi shape memory alloys via vacuum induction melting. An ingot was synthesized from elemental Ni and Ti and subjected to three subsequent remelting cycles. Remelting increases process durations and impurity levels and adversely affects microstructures and functional properties.
Sakia Sophia Noorzayee +7 more
wiley +1 more source
The Windy Postman Problem on Series-Parallel Graphs [PDF]
Discrete Mathematics & Theoretical Computer Science, 2005 The windy postman problem is the NP-hard problem of finding the minimum cost of a tour traversing all edges of an undirected graph, where the cost of traversal of an edge depends on the direction. Given an undirected graph $G$, we consider the polyhedron
Francisco Javier Zaragoza Martínez
doaj +1 more source
Compositions for perfect graphs
Discrete Mathematics, 1985 In this paper we introduce a new graph composition, called 2-amalgam, and we prove that the 2-amalgam of perfect graphs is perfect. This composition generalizes many of the operations known to preserve perfection, such as the clique identification, substitution, join and amalgam operations.
Gérard Cornuéjols +1 more
openaire +1 more source
Influence of Geometric Design on Mechanical Performance of Auxetic Metastructure
Advanced Engineering Materials, EarlyView.Strategic geometric reinforcement transforms auxetic performance. This study evaluates 3D‐printed arrowhead metastructures, revealing that a modified design with local ring reinforcement suppresses premature failure to achieve superior energy absorption and structural efficiency.
Muhammad Gulzari +3 more
wiley +1 more source
Decomposition of perfect graphs
Journal of Combinatorial Theory, Series B, 1987 In this paper we describe general composition and decomposition schemes for perfect graphs, which covers almost all recent results in this area, e.g. the amalgam and the 2-amalgam split. Our approach is based on the consideration of induced cycles and their complements in perfect graphs (as opposed to the consideration of cycles for defining ...
openaire +2 more sources
Progress on perfect graphs [PDF]
Mathematical Programming, 2003 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Maria Chudnovsky +3 more
openaire +1 more source
A semi-strong Perfect Graph theorem
, 1987 Perfect Graphs were defined by Claude Berge in 1961. Since that time this class of graphs has been intensely studied. Much of the work has been directed towards proving Berge's Strong and Weak Perfect Graph Conjectures. L. Lovász finally demonstrated the
Reed, B
core +1 more source
Advanced Engineering Materials, EarlyView.Molecular dynamics is used to investigate structure refinement during severe plastic deformation. The results show similitude with experimental data. Molecular dynamics simulations of severe plastic deformation of monocrystalline and polycrystalline samples by multiaxial compression of aluminum are carried out.
Roberto B. Figueiredo
wiley +1 more source
Some results on one type of graph family with some special number sequences
AKCE International Journal of Graphs and Combinatorics, 2020 In this study, we introduce a new graph family. Then, we calculate eigenvalues of the adjacency and the Laplacian matrix of this graph family. Moreover, we show that the perfect matching number of this graph family equals to special second order ...
Emrullah Kirklar +2 more
doaj +1 more source
Electronic Notes in Discrete Mathematics, 2002 Abstract A graph is perfect if each of its induced subgraphs H has the property that its chromatic number χ(H) equals its clique number ω(H). The Strong Perfect Graph Conjecture (SPGC) states: An undirected graph is perfect if and only if neither G nor its complement G contains, as an induced subgraph, a chordless cycle whose length is odd and ...
Agnes V. Dizon-Garciano +2 more
openaire +1 more source