Results 101 to 110 of about 605,731 (305)
A note on some extremal problems for trigonometric polynomials [PDF]
n.a.
Dette, Holger, Melas, Viatcheslav B.
core
Advanced Engineering Materials, EarlyView.Building machine‐readable vocabularies for materials science is slow, expert‐driven work. This study benchmarks 13 large language models on two of its first steps: finding candidate terms in engineering articles and deciding where they belong in a class hierarchy.
Thomas Bjarsch +3 more
wiley +1 more source
Information Inequalities via Submodularity and a Problem in Extremal Graph Theory. [PDF]
Entropy (Basel), 2022 Sason I.
europepmc +1 more source
On an extremal problem in graph theory [PDF]
Colloquium Mathematicum, 1964 Let \(l\) and \(p\) be integers such that \(l>p\). It is shown that there exists a constant \(\gamma_{p,l}\) such that if \(n>n_0(p,l)\) then every graph with \(n\) vertices and \([\gamma_{p,l}n^{2-1/p}]\) edges contains a subgraph \(H\) with the following property: the vertices of \(H\) may be labbeled \(x_1,...,x_l\) and \(y_1,...,y_l\) so that every
openaire +2 more sources
On extremal properties of graph entropies
, 2020 We study extremal properties of graph entropies based on so-called information functionals. We obtain some extremality results for the resulting graph entropies which rely on the well-known Shannon entropy.
Veronika Kraus, Matthias Dehmer
core
Advanced 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
Extremal Graphs for the Suspension of Edge-Critical Graphs
The Electronic Journal of CombinatoricsThe Turán number of a graph $H$, $\text{ex}(n,H)$, is the maximum number of edges in an $n$-vertex graph that does not contain $H$ as a subgraph. For a vertex $v$ and a multi-set $\mathcal{F}$ of graphs, the suspension $\mathcal{F}+v$ of $\mathcal{F}$ is the graph obtained by connecting the vertex $v$ to all vertices of $F$ for each $F\in \mathcal{F}$.
Jianfeng Hou, Heng Li, Qinghou Zeng
openaire +4 more sources
Extremal graphs of diameter 3 [PDF]
Journal of the Australian Mathematical Society, 1979 AbstractThis paper is concerned with graphs of order n and diameter at most 3 having the property that by deleting any s or fewer vertices (edges) the resulting subgraphs (partial graphs) have duameter at most. λ. A graph satisfying the above constraints and having minimum number of edges is said to be extramal. A characterization of extremal graphs is
openaire +2 more sources
New AI‐Assisted Approach for Expanding the Solution Space: Application to Lattice Structure Design
Advanced Engineering Materials, EarlyView.This work introduces an innovative framework for designing structured materials by ex panding the design space through reparameterization of qualitative variables into continuous structural descriptors. Combined with machine‐learning‐based prediction and multi‐objective optimization, the approach enables the discovery of novel lattice architectures ...
G. H. Gahimbare +5 more
wiley +1 more source
Det-Extremal Cubic Bipartite Graphs
, 2003 Let G be a connected k-regular bipartite graph with bipartition $V(G) = X \cap Y$ and adjacency matrix A. We say G is det-extremal if per(A) = |det(A)|. Det-extremal k-regular bipartite graphs exist only for k = 2 or 3.
D. Labbate +6 more
core +1 more source