Results 61 to 70 of about 34,690 (269)

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

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

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

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

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

On two problems in Ramsey-Tur\'an theory

open access: yes, 2017
Alon, Balogh, Keevash and Sudakov proved that the $(k-1)$-partite Tur\'an graph maximizes the number of distinct $r$-edge-colorings with no monochromatic $K_k$ for all fixed $k$ and $r=2,3$, among all $n$-vertex graphs.
Balogh, József   +2 more
core   +1 more source

EXTREMAL THEORY OF ORDERED GRAPHS [PDF]

open access: yesProceedings of the International Congress of Mathematicians (ICM 2018), 2019
We call simple graphs with a linear order on the vertices ordered graphs. Turán-type extremal graph theory naturally extends to ordered graphs. This is a survey on the ongoing research in the extremal theory of ordered graphs with an emphasis on open problems.
openaire   +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

Grain Refinement During Severe Plastic Deformation and Similitude of Subgrain Formation: A Molecular Dynamics Study

open access: yesAdvanced Engineering Materials, EarlyView.
Molecular dynamics is used to investigate structure refinement during severe plastic deformation. The results show similitude with experimental data. Molecular dynamics simulations of severe plastic deformation of monocrystalline and polycrystalline samples by multiaxial compression of aluminum are carried out.
Roberto B. Figueiredo
wiley   +1 more source

On extremal numbers of the triangle plus the four-cycle

open access: yesForum of Mathematics, Sigma
For a family $\mathcal {F}$ of graphs, let ${\mathrm {ex}}(n,\mathcal {F})$ denote the maximum number of edges in an n-vertex graph which contains none of the members of $\mathcal {F}$ as a subgraph.
Jie Ma, Tianchi Yang
doaj   +1 more source

Home - About - Disclaimer - Privacy