Results 71 to 80 of about 39,392 (275)

Some extremal problems for hereditary properties of graphs

open access: yes, 2013
This note answers extremal questions like: what is the maximum number of edges in a graph of order n, which belongs to some hereditary property.
Nikiforov, Vladimir
core   +1 more source

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

open access: yesAdvanced 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   +5 more
wiley   +1 more source

On Vertex Degree-Based Topological Indices for Fixed Branching Vertices of Trees

open access: yesJournal of Chemistry, 2022
The Gourava indices and hyper-Gourava indices are graph invariants, related to the degree of vertices of a graph G. Let Tn,b denote the collection of all chemical trees with n vertices where b denotes the number of branching vertices, 1 ...
Muzamil Hanif   +3 more
doaj   +1 more source

Assessing Altered Coating Adhesion on Plasma‐Deoxidized Surfaces Under Oxygen‐Free Conditions

open access: yesAdvanced Engineering Materials, EarlyView.
This study demonstrates the effectiveness of atmospheric pressure plasma pretreatment in modifying silicon and stainless steel surfaces to improve adhesion. Argon‐hydrogen plasma increases surface roughness and improves adhesion strength, whereas pure argon results in smoother surfaces and structural changes.
Selina Raumel   +6 more
wiley   +1 more source

List graphs and distance-consistent node labelings

open access: yesElectronic Journal of Graph Theory and Applications, 2018
In this paper we consider node labelings c of an undirected connected graph G = (V, E) with labels {1, 2, ..., ∣V∣}, which induce a list distance c(u, v) = ∣c(v) − c(u)∣ besides the usual graph distance d(u, v).
Håkan Lennerstad, Mattias Eriksson
doaj   +1 more source

The maximum number of $P_\ell$ copies in $P_k$-free graphs [PDF]

open access: yesDiscrete Mathematics & Theoretical Computer Science, 2019
Generalizing Tur\'an's classical extremal problem, Alon and Shikhelman investigated the problem of maximizing the number of $T$ copies in an $H$-free graph, for a pair of graphs $T$ and $H$.
Ervin Győri   +3 more
doaj   +1 more source

Toward Low‐Consumable Anodes: Process Simulation and Prospective Life Cycle Assessment of NiFe2O4‐NiO‐Ni‐Cu vs. Prebaked Anodes for Aluminum Production with use of Molten Salt Electrolysis

open access: yesAdvanced Engineering Materials, EarlyView.
Low‐consumable nickel ferrite‐based anodes for the Hall–Héroult process are compared with conventional prebaked carbon anodes using thermodynamic simulation and prospective life cycle assessment under contrasting future electricity system pathways from 2025 to 2050.
Felipe Alejandro Garcia Paz   +6 more
wiley   +1 more source

Hypergraphs with infinitely many extremal constructions

open access: yesDiscrete Analysis, 2023
Hypergraphs with infinitely many extremal constructions, Discrete Analysis 2023:18, 34 pp. A fundamental result in extremal graph theory, Turán's theorem, states that the maximal number of edges of a graph with $n$ vertices that does not contain a ...
Jianfeng Hou   +4 more
doaj   +1 more source

Extremal metrics on graphs I [PDF]

open access: yesForum Mathematicum, 2002
We define a number of natural (from geometric and combinatorial points of view) deformation spaces of valuations on finite graphs, and study functions over these deformation spaces. These functions include both direct metric invariants (girth, diameter), and spectral invariants (the determinant of the Laplace operator, or complexity; bottom non-zero ...
Jakobson, Dmitry, Rivin, Igor
openaire   +2 more sources

Workflow for Design of Experiments‐Based Modeling of Species Transport and Growth Kinetics in GaN Hydride Vapor Phase Epitaxy

open access: yesAdvanced Engineering Materials, EarlyView.
A novel workflow for investigating hydride vapor phase epitaxy for GaN bulk crystal growth is proposed. It combines Design of experiments (DoE) with physical simulations of mass transport and crystal growth kinetics, serving as an intermediate step between DoE and experiments.
J. Tomkovič   +7 more
wiley   +1 more source

Home - About - Disclaimer - Privacy