Results 111 to 120 of about 8,004,238 (365)
Electronic Journal of Graph Theory and Applications, 2013 This article gives a survey of all results on the power graphs of groups and semigroups obtained in the literature. Various conjectures due to other authors, questions and open problems are also included.
Andrei V. Kelarev +2 more
openaire +4 more sources
A Validated Model to Predict Severe Weight Loss in Amyotrophic Lateral Sclerosis
Annals of Clinical and Translational Neurology, EarlyView.ABSTRACT Severe weight loss in amyotrophic lateral sclerosis (ALS) is common, multifactorial, and associated with shortened survival. Using longitudinal weight data from over 6000 patients with ALS across three cohorts, we built an accelerated failure time model to predict the risk of future severe (≥ 10%) weight loss using five single‐timepoint ...
David G. Lester +4 more
wiley +1 more source
Independence ratios of graph powers
Discrete Mathematics, 1994 Consider the limiting behaviour of the independence ratio of increasing cartesian powers of a graph. The authors observe that the limit always exists, and illustrate several situations in which the limit can be evaluated.
Huishan Zhou, Xingxing Yu, Pavol Hell
openaire +2 more sources
Real‐World Comparison of High‐Efficacy Versus Non‐High‐Efficacy Therapies in Multiple Sclerosis
Annals of Clinical and Translational Neurology, EarlyView.ABSTRACT Objective The choice of the first disease modifying treatment (DMT) in multiple sclerosis (MS) is a topic of great interest, and whether high‐efficacy DMTs should be the first choice remains debated. We compared treatment outcomes (no evidence of disease activity [NEDA] and its components) between treatment‐naïve relapsing–remitting MS (RRMS ...
Sarmad Al‐Araji +9 more
wiley +1 more source
Arthritis Care &Research, Accepted Article.Objective This study aimed to determine if program format (in‐person, virtual, hybrid) results in differences in three‐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 GLA:DTM Canada database was completed.
Jill Van Damme +7 more
wiley +1 more source
On some characterizations of strong power graphs of finite groups
Special Matrices, 2016 Let G be a finite group of order n. The strong power graph Ps(G) of G is the undirected graph whose vertices are the elements of G such that two distinct vertices a and b are adjacent if am1=bm2 for some positive integers m1, m2 < n.
Bhuniya A. K., Bera Sudip
doaj +1 more source
Power optimization in MANET using topology management
Engineering Science and Technology, an International Journal, 2020 Mobile ad-hoc network (MANET) is a wireless ad hoc network, which is quickly deployable and functions without any infrastructure. This work proposes a hybrid optimization algorithm, named Chronological-Earth Worm optimization Algorithm (C-EWA), for ...
B. Devika, P.N. Sudha
doaj +1 more source
On powers and centers of chordal graphs
Discrete Applied Mathematics, 1983 AbstractA graph is chordal if every cycle of length strictly greater than three has a chord. A necessary and sufficient condition is given for all powers of a chordal graph to be chordal. In addition, it is shown that for connected chordal graphs the center (the set of all vertices with minimum eccentricity) always induces a connected subgraph.
Renu C. Laskar, Douglas R. Shier
openaire +3 more sources
Arthritis Care &Research, Accepted Article.Recently, there has been growing discussion about how to best assess pain in clinical trials in rheumatic diseases. Reliable measurement of pain outcomes is essential for accurately determining the effectiveness of treatments. While pain intensity is the most common measure of change in pain trials, other pain‐related measures, such as pain ...
Yen T. Chen +4 more
wiley +1 more source
Powers of distance-hereditary graphs
Discrete Mathematics, 1995 Powers of graphs that belong to several classes have been studied. In this paper, the authors investigate powers of distance-hereditary graphs. A connected graph \(G\) is distance-hereditary if every induced path \(H\) of \(G\) is isometric; that is, the distance of any two vertices in \(H\) equals their distance in \(G\). For \(G\) distance-hereditary,
Anja Henkmann +2 more
openaire +3 more sources