Results 91 to 100 of about 1,376 (263)

Extremal subgraphs for two graphs

open access: yesJournal of Combinatorial Theory, Series B, 1985
In this paper we study several interrelated extremal graph problems: (i) Given integers \(n,e,m\), what is the largest integer f(n,e,m) such that every graph with \(n\) vertices and \(e\) edges must have an induced m-vertex subgraph with at least \(f(n,e,m)\) edges? (ii) Given integers \(n,e,e'\), what is the largest integer \(g(n,e,e')\) such that any
Fan R. K. Chung   +2 more
openaire   +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

The Influence of Field‐Assisted Sintering Technology (FAST) Temperature and Cooling Rate on the Microstructural Evolution in Gamma‐Titanium Aluminide Alloy GE4822

open access: yesAdvanced Engineering Materials, EarlyView.
Controlling the Field Assisted Sintering Technology (FAST) parameters, dwell temperature and cooling rate, significantly influences the microstructural evolution in titanium aluminide GE4822. Significant γ‐lamellar colonies develop only upon cooling through the α‐transus.
Jack Krohn, James Pepper, Martin Jackson
wiley   +1 more source

Bio‐Inspired Synthesis of Macroporous Single Crystal Particles as Scattering Agents

open access: yesAdvanced Functional Materials, EarlyView.
A general strategy is presented that delivers unique, single‐crystal microparticles that combine submicron macroporosity and uniform particle shapes. A bioinspired approach is used to occlude three distinct types of additives – polystyrene microspheres, polymer vesicles and amino acids – within calcite single crystals, and subsequent thermal annealing ...
Stephanie E. Foster   +11 more
wiley   +1 more source

Two Short Proofs on Total Domination

open access: yesDiscussiones Mathematicae Graph Theory, 2013
A set of vertices of a graph G is a total dominating set if each vertex of G is adjacent to a vertex in the set. The total domination number of a graph Υt (G) is the minimum size of a total dominating set.
Bickle Allan
doaj   +1 more source

Biodegradable and Biocompatible Functional Polymers for Biomedical Applications

open access: yesAdvanced Functional Materials, EarlyView.
Biodegradable and biocompatible functional polymers integrate electrical, mechanical, and stimuli‐responsive functionalities while enabling programmed degradation under physiological conditions. This review introduces recent advances in conductive, shape‐memory, self‐healing, photocurable, and adhesive polymer systems, emphasizing material design ...
Won Bae Han   +5 more
wiley   +1 more source

On the Numbers of Cut-Vertices and End-Blocks in 4-Regular Graphs

open access: yesDiscussiones Mathematicae Graph Theory, 2014
A cut-vertex in a graph G is a vertex whose removal increases the number of connected components of G. An end-block of G is a block with a single cut-vertex.
Wang Dingguo, Shan Erfang
doaj   +1 more source

Interlacing - extremal graphs

open access: yes, 2013
A graph G is singular if the zero-one adjacency matrix has the eigenvalue zero. The multiplicity of the eigenvalue zero is called the nullity of G. For two vertices y and z of G, we call (G, y, z) a device with respect to y and z. The nullities of G, G − y,  G − z and G − y − z classify devices into different kinds.
Borg, Martha   +4 more
openaire   +2 more sources

On a problem in extremal graph theory

open access: yesJournal of Combinatorial Theory, Series B, 1977
From the authors introduction. Let \(G(n,m)\) denote a graph \((V,E)\) with \(n\) vertices and \(m\) edges and \(K_1\) a complete graph with \(i\) vertices. \textit{P.Turán} proved that every \(G(n,T(n,k))\) contains a \(K_k\), where \[ T(n,k) = \frac{k-2}{2(k-1)}(n^2-r^2)+\binom r2+1, \] \(r\equiv n(\mod k-1)\) and \(0\leq r\leq k-2\).
D. T. Busolini, Paul Erdös
openaire   +1 more source

Artificial Intelligence‐Assisted Workflow for Transmission Electron Microscopy: From Data Analysis Automation to Materials Knowledge Unveiling

open access: yesAdvanced Materials, EarlyView.
AI‐Assisted Workflow for (Scanning) Transmission Electron Microscopy: From Data Analysis Automation to Materials Knowledge Unveiling. Abstract (Scanning) transmission electron microscopy ((S)TEM) has significantly advanced materials science but faces challenges in correlating precise atomic structure information with the functional properties of ...
Marc Botifoll   +19 more
wiley   +1 more source

Home - About - Disclaimer - Privacy