Results 81 to 90 of about 42,675 (259)
In the process of development and construction of open-pit mine slope in the high altitude and cold area, freeze-thaw (F-T) cycles have an important impact on rock engineering structure.
Yong-gang Xiao +5 more
doaj +1 more source
Fostering Innovation: Streamlining Magnetocaloric Materials Research by Digitalization
Magnetocaloric cooling (MCE) is an environmentally friendly refrigeration method with great potential. Optimizing MCE materials involves the preparation and screening of large quantities of samples, which in turn generates a large amount of data. A digitalization approach is presented that uses ontologies, knowledge graphs, and digital workflows to ...
Simon Bekemeier +17 more
wiley +1 more source
On the Complexity of Stacked Graphs Associated with Paths and Cycles
The complexity of a graph, defined as its number of spanning trees, serves as a key measure of network reliability. Stacked graphs constitute a significant and versatile class of graphs, formed by superimposing multiple copies of a base graph upon a ...
Salama Nagy Daoud, Ahmad Asiri
doaj +1 more source
Decompositions of digraphs into paths and cycles
If A denotes a subset of the vertex set V of a directed graph G, let f(A) denote the number of arcs directed from a vertex of A to a vertex of \(V\setminus A\); let \(\lambda_ G\) denote the supremum of f(A) over all subsets A. The author shows, among other things, that there exists a partition of the arcs of any directed graph G into at most ...
openaire +2 more sources
Optimal gossiping in paths and cycles
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Lau, FCM, Zhang, SH
openaire +3 more sources
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
Decomposition of hypercube graphs into paths and cycles having k edges
For an even graph G and positive integer p, q, and k, the pair (p, q) is an admissible pair if [Formula: see text]. If a graph G admits a decomposition into p copies of [Formula: see text], the path of length k, and q copies of Ck, the cycle of length k,
D. Saranya +3 more
doaj +1 more source
Identifiable Paths and Cycles in Linear Compartmental Models. [PDF]
Bortner C, Meshkat N.
europepmc +1 more source
The i-chords of cycles and paths
An i-chord of a cycle or path is an edge whose endpoints are a distance i ≥ 2 apart along the cycle or path. Motivated by many standard graph classes being describable by the existence of chords, we investigate what happens when i-chords are required for specific values of i.
openaire +1 more source
The PRIMA Thesaurus for Materials Science and Engineering
The PRIMA Thesaurus is a structured vocabulary designed to improve how materials science data is described and shared. Developed with input from multiple experts, it enables clear documentation of research workflows, data exchange, and reuse across platforms.
Rossella Aversa +8 more
wiley +1 more source

