Results 61 to 70 of about 59,692 (266)

Binding Number, Toughness and General Matching Extendability in Graphs [PDF]

open access: yesDiscrete Mathematics & Theoretical Computer Science, 2019
A connected graph $G$ with at least $2m + 2n + 2$ vertices which contains a perfect matching is $E(m, n)$-{\it extendable}, if for any two sets of disjoint independent edges $M$ and $N$ with $|M| = m$ and $|N|= n$, there is a perfect matching $F$ in $G ...
Hongliang Lu, Qinglin Yu
doaj   +1 more source

Circular perfect graphs [PDF]

open access: yesJournal of Graph Theory, 2005
AbstractFor 1 ≤ d ≤ k, let Kk/d be the graph with vertices 0, 1, …, k − 1, in which i ∼j if d ≤ |i − j| ≤ k − d. The circular chromatic number χc(G) of a graph G is the minimum of those k/d for which G admits a homomorphism to Kk/d. The circular clique number ωc(G) of G is the maximum of those k/d for which Kk/d admits a homomorphism to G. A graph G is
openaire   +1 more source

Recycling of NiTi Shape Memory Alloys: Fundamental and Technological Aspects of a Vacuum Induction Melting Processing Route

open access: yesAdvanced 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

A characterization of perfect graphs

open access: yesJournal of Combinatorial Theory, Series B, 1972
AbstractIt is shown that a graph is perfect iff maximum clique · number of stability is not less than the number of vertices holds for each induced subgraph. The fact, conjectured by Berge and proved by the author, follows immediately that the complement of a perfect graph is perfect.
openaire   +2 more sources

Neighborhood perfect graphs

open access: yesDiscrete Mathematics, 1986
Let G be a graph. The authors denote by \(\alpha_ N(G)\) the maximum number of edges of G such that no two of them belong to the same neighborhood subgraph of G (that is a subgraph induced by a vertex v and the vertices adjacent to v). They denote by \(\rho_ N(G)\) the minimum number of vertices whose neighborhood subgraphs cover the edge set of G.
Jenö Lehel, Zsolt Tuza
openaire   +1 more source

Ontology‐Aligned Structuring and Reuse of Multimodal Materials Data and Workflows Toward Automatic Reproduction

open access: yesAdvanced Engineering Materials, EarlyView.
Reproduction of stacking fault energy calculations from literature with a semi‐automated large language model‐assisted extraction procedure: extraction of simulation protocol, atomistic structures, computational parameters, and reported results, ontology alignment, knowledge graph construction and, finally, recomputation forvalidation.
Sepideh Baghaee Ravari   +5 more
wiley   +1 more source

Additive Manufacturing of Alumina‐Reinforced Elastomers

open access: yesAdvanced Engineering Materials, EarlyView.
Vat‐photopolymerized elastomers reinforced with platelet‐shaped alumina exhibited preferential orientation, reduced porosity, and significantly enhanced mechanical performance. A 3 wt% platelet loading increased tensile strength from 12.4 to 45.7 MPa, highlighting the critical role of filler morphology in elastomeric VPP composites.
Majid Barzegar Keyvani   +6 more
wiley   +1 more source

Extrusion‐Based Additive Manufacturing of Advanced Ceramics: Strengthening Mechanisms and Process Optimization Review

open access: yesAdvanced Engineering Materials, EarlyView.
This review comprehensively evaluates extrusion‐based additive manufacturing for advanced ceramics, detailing feedstock options and key process parameters. By critically addressing defect mechanisms like porosity and cracking, the work highlights optimization strategies through machine learning and advanced postprocessing.
Meisam Bakhtiari   +4 more
wiley   +1 more source

Trivially perfect graphs

open access: yesDiscrete Mathematics, 1978
AbstractAn undirected graph is trivially perfect if for every induced subgraph the stability number equals the number of (maximal) cliques. We characterize the trivially perfect graphs as a proper subclass of the triangulated graphs (thus disproving a claim of Buneman [3]), and we relate them to some well-known classes of perfect graphs.
openaire   +2 more sources

Semantic Modeling in Materials Science and Engineering With Platform MaterialDigital Core Ontology 3.0

open access: yesAdvanced Engineering Materials, EarlyView.
The community‐driven Platform MaterialDigital Core Ontology (PMDco) 3.0 is introduced as a Basic Formal Ontology‐aligned semantic backbone for the processing–structure–properties paradigm in Materials Science and Engineering. Modular engineering, automated releases, and validation workflows are highlighted and key semantic patterns for materials ...
Markus Schilling   +15 more
wiley   +1 more source

Home - About - Disclaimer - Privacy