Results 81 to 90 of about 29,541 (268)

Temperature and Multiplicative Temperature Indices of Nanotubes TUC4C8[p,q]

open access: yesTikrit Journal of Pure Science, 2020
Topological indices are  a numerical parameter of  a graph ,sometimes also called as a graph –theoretic index, is a number invariant of a chemical graph .Particular topological indices include the types of temperature and multiplicative temperature ...
Arif E. Nabeel, Najm K. Hussein
doaj   +1 more source

A Return to Normality: A Descriptive Qualitative Interview Study Exploring the Patient Experience of Gout Flare Resolution

open access: yesArthritis Care &Research, EarlyView.
Objective Although the definition of a gout flare is well established, the state of gout flare resolution has not yet been defined. This study aimed to explore patients’ experiences and perceptions of gout flare resolution. Methods Semistructured interviews were conducted with 24 people with gout, guided by open‐ended questions exploring their ...
Sarah Stewart   +5 more
wiley   +1 more source

Longitudinal Changes in Adiposity After a Youth Sport‐Related Knee Injury: Informing Posttraumatic Osteoarthritis Prevention

open access: yesArthritis Care &Research, EarlyView.
Objective Youth who experience a sport‐related knee injury have elevated odds of becoming overweight or developing obesity in 3 to 10 years, compounding their risk for posttraumatic osteoarthritis (PTOA). To inform prevention strategies, this study compared patterns of adiposity change between youth with a sport‐related knee injury and uninjured youth ...
Justin M. Losciale   +6 more
wiley   +1 more source

On the vertex-degree based invariants of digraphs [PDF]

open access: yesDiscrete Mathematics Letters, 2021
Hanyuan Deng   +4 more
doaj   +1 more source

COLORING INVARIANTS OF SPATIAL GRAPHS [PDF]

open access: yesJournal of Knot Theory and Its Ramifications, 2010
We define the fundamental quandle of a spatial graph and several invariants derived from it. In the category of graph tangles, we define an invariant based on the walks in the graph and cocycles from nonabelian quandle cohomology.
openaire   +2 more sources

Mechanochemical Synthesis and Characterization of Nanostructured ErB4 and NdB4 Rare‐Earth Tetraborides

open access: yesAdvanced Engineering Materials, Volume 27, Issue 6, March 2025.
ErB4 and NdB4 nanostructured powders are produced by mechanochemical synthesis. 5 h mechanical alloying and 4 M HCl acid leaching are used in the production. ErB4 and NdB4 powders exhibit maximum magnetization of 0.4726 emu g−1 accompanied with an antiferromagnetic‐to‐paramagnetic phase transition at about TN = 18 K and 0.132 emu g−1 with a maximum at ...
Burçak Boztemur   +5 more
wiley   +1 more source

Some results on the Sombor indices of graphs [PDF]

open access: yesContributions to Mathematics, 2021
Igor Milovanovic   +3 more
doaj   +1 more source

On invariants of hereditary graph properties

open access: yesDiscrete Mathematics, 2007
A hereditary property of graphs is a class \(\mathcal{P}\) of graphs that contains all isomorphs and subgraphs of its elements. Such a property is determined by its minimal forbidden graphs, those graphs that do not belong to \(\mathcal{P}\) but whose proper subgraphs all do.
Peter Mihók, Gabriel Semanisin
openaire   +1 more source

A Workflow to Accelerate Microstructure‐Sensitive Fatigue Life Predictions

open access: yesAdvanced Engineering Materials, EarlyView.
This study introduces a workflow to accelerate predictions of microstructure‐sensitive fatigue life. Results from frameworks with varying levels of simplification are benchmarked against published reference results. The analysis reveals a trade‐off between accuracy and model complexity, offering researchers a practical guide for selecting the optimal ...
Luca Loiodice   +2 more
wiley   +1 more source

Explicit Formulas for the Complexity of Networks Produced by New Duplicating Corona and Cartesian Product

open access: yesJournal of Mathematics
One important algebraic invariant in networks is complexity. This invariant ensures the accuracy and dependability of the network. In this paper, we employ a combinatorial approach to determine the graph’s complexity. A fundamental set of building blocks
Mohamed R. Zeen El Deen   +2 more
doaj   +1 more source

Home - About - Disclaimer - Privacy