Results 61 to 70 of about 34,637 (273)

Regularity lemmas in a Banach space setting

open access: yes, 2015
Szemer\'edi's regularity lemma is a fundamental tool in extremal graph theory, theoretical computer science and combinatorial number theory. Lov\'asz and Szegedy [L. Lov\'asz and B.
Regts, Guus
core   +2 more sources

Evaluating a Pragmatic Strength Alternative for Frailty Measurement and Assessing Its Predictive Capacity Against Established Frailty Instruments in Rheumatoid Arthritis

open access: yesArthritis Care &Research, EarlyView.
Objective Frailty occurs prematurely in rheumatoid arthritis (RA) and is associated with poor health outcomes. We compared the performance of four frailty instruments, including a pragmatic alternative measure using chair sit‐to‐stand (STS), and evaluated their abilities to predict poor health outcomes.
Kylie E. Riggles   +14 more
wiley   +1 more source

Graph Theory and Qubit Information Systems of Extremal Black Branes

open access: yes, 2014
Using graph theory based on Adinkras, we consider once again the study of extremal black branes in the framework of quantum information. More precisely, we propose a one to one correspondence between qubit systems, Adinkras and certain extremal black ...
Belhaj, Adil   +2 more
core   +1 more source

A Numerical–Experimental Approach for Multi‐Matrix Fiber‐Reinforced Plastics Characterization Using Finite Element Model Updating

open access: yesAdvanced Engineering Materials, EarlyView.
A numerical–experimental framework is developed for characterizing multi‐matrix fiber‐reinforced polymers (MM‐FRPs) combining epoxy and polyurethane matrices. Harmonic bending tests are integrated with finite element model updating (FEMU) to simultaneously identify elastic and viscoelastic material parameters.
Rodrigo M. Dartora   +4 more
wiley   +1 more source

A Survey of Maximal k-Degenerate Graphs and k-Trees

open access: yesTheory and Applications of Graphs
This article surveys results on maximal $k$-degenerate graphs, $k$-trees, and related classes including simple $k$-trees, $k$-paths, maximal outerplanar graphs, and Apollonian networks.
Allan Bickle
doaj   +1 more source

Stateless Quantum Structures and Extremal Graph Theory

open access: yesReports on Mathematical Physics, 2020
We study hypergraphs which represent finite quantum event structures. We contribute to results of graph theory, regarding bounds on the number of edges, given the number of vertices. We develop a missing one for 3-graphs of girth 4. As an application of the graph-theoretical approach to quantum structures, we show that the smallest orthoalgebra with an
openaire   +2 more sources

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

Network Density of States

open access: yes, 2019
Spectral analysis connects graph structure to the eigenvalues and eigenvectors of associated matrices. Much of spectral graph theory descends directly from spectral geometry, the study of differentiable manifolds through the spectra of associated ...
Benson, Austin R.   +2 more
core   +1 more source

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

Exact Formula and Improved Bounds for General Sum-Connectivity Index of Graph-Operations

open access: yesIEEE Access, 2019
For a molecular graph Γ, the general sum-connectivity index is defined as χβ(Γ) = Σvw∈E(Γ)[dΓ(v) + dΓ(w)]β, where β ∈ R and dΓ(v) denotes the degree of the vertex ...
Maqsood Ahmad   +3 more
doaj   +1 more source

Home - About - Disclaimer - Privacy