Results 51 to 60 of about 39,296 (257)

Unicyclic Graphs with the Fourth Extremal Wiener Indices

open access: yesJournal of Chemistry, 2020
A graph is called unicyclic if the graph contains exactly one cycle. Unicyclic graphs with the fourth extremal Wiener indices are characterized. It is shown that, among all unicyclic graphs with n≥8 vertices, C5Sn−4 and C2u1,u2S3,Sn−4 attain the fourth ...
Guangfu Wang   +3 more
doaj   +1 more source

Some Bond Incident Degree Indices of (Molecular) Graphs with Fixed Order and Number of Cut Vertices

open access: yesDiscrete Dynamics in Nature and Society, 2021
A bond incident degree (BID) index of a graph G is defined as ∑uv∈EGfdGu,dGv, where dGw denotes the degree of a vertex w of G, EG is the edge set of G, and f is a real-valued symmetric function. The choice fdGu,dGv=adGu+adGv in the aforementioned formula
Abeer M. Albalahi   +3 more
doaj   +1 more source

Development of a Personalized Visualization and Analysis Tool to Improve Clinical Care in Complex Multisystem Diseases With Application to Scleroderma

open access: yesArthritis Care &Research, EarlyView.
Objective In complex diseases, it is challenging to assess a patient's disease state, trajectory, treatment exposures, and risk of multiple outcomes simultaneously, efficiently, and at the point of care. Methods We developed an interactive patient‐level data visualization and analysis tool (VAT) that automates illustration of the trajectory of a ...
Ji Soo Kim   +18 more
wiley   +1 more source

Zeroth-order general Randić index of cactus graphs

open access: yesAKCE International Journal of Graphs and Combinatorics, 2019
A connected graph G is said to be cactus if no two cycles of G have any common edge. The present note is devoted to developing some extremal results for the zeroth-order general Randić index of cactus graphs and finding some sharp bounds on this index ...
Hassan Ahmed   +2 more
doaj   +2 more sources

Some new upper bounds of

open access: yesAKCE International Journal of Graphs and Combinatorics, 2017
The extremal number or simply denotes the maximal number of edges in a graph on vertices with forbidden subgraphs and . The exact number of is only known for up to and . There are upper and lower bounds of for other values of .
Novi H. Bong
doaj   +1 more source

Virtual or In‐Person: Does It Matter? Comparing Pain, Function, Quality of Life, Self‐Efficacy, and Physical Function Outcomes of Virtual, Hybrid, and In‐Person Education and Exercise Program Participants

open access: yesArthritis Care &Research, EarlyView.
Objective This study aimed to determine if program format (in‐person, virtual, or hybrid) results in differences in 3‐month outcomes of pain, function, quality of life, self‐efficacy, and chair stands in a hip/knee osteoarthritis‐management program. Methods A secondary analysis of the Good Life with osteoArthritis in Denmark (GLA:D) Canada database was
Jill Van Damme   +7 more
wiley   +1 more source

Extremal Results in Random Graphs [PDF]

open access: yes, 2013
According to Paul Erd s [Some notes on Tur n's mathematical work, J. Approx. Theory 29 (1980), page 4] it was Paul Tur n who "created the area of extremal problems in graph theory". However, without a doubt, Paul Erd s popularized extremal combinatorics, by his many contributions to the field, his numerous questions and conjectures, and his ...
Rödl, Vojtěch, Schacht, Mathias
openaire   +2 more sources

Association Between Symptomatic Knee Osteoarthritis and Target Glycemic Control in Individuals with Type 2 Diabetes

open access: yesArthritis Care &Research, Accepted Article.
Objective Knee osteoarthritis (OA) commonly affects individuals with Type 2 diabetes (T2DM) and is associated with increased risk of diabetes‐related complications. To better understand potential mechanisms, we examined the association between symptomatic knee OA and glycemic control in individuals with T2DM.
Lauren K. King   +10 more
wiley   +1 more source

Moving to Extremal Graph Parameters [PDF]

open access: yes, 2013
Which graphs, in the class of all graphs with given numbers n and m of edges and vertices respectively, minimizes or maximizes the value of some graph parameter? In this paper we develop a technique which provides answers for several different parameters:
Cameron, P. J.   +2 more
core  

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

Home - About - Disclaimer - Privacy