Results 51 to 60 of about 1,124,405 (260)

On the Weak Reconstruction of Strong Product Graphs

open access: yesElectronic Notes in Discrete Mathematics, 2003
We prove that any nontrivial connected strong product graph can be uniquely reconstructed from each of its one vertex deleted subgraphs.
Blaz Zmazek, Janez Zerovnik
openaire   +2 more sources

A Bibliometric Analysis of Publications in Uremic Toxins From 1991 to 2024

open access: yesTherapeutic Apheresis and Dialysis, EarlyView.
ABSTRACT Background Uremic toxins are a growing area of research in nephrology, with significant implications in the progression and treatment of chronic kidney disease (CKD) and the management of end‐stage kidney disease (ESKD). This bibliometric analysis aims to evaluate the global research trends, key contributors, and the impact of publications in ...
Yuh‐Shan Ho   +7 more
wiley   +1 more source

Sharp Upper Bounds for Generalized Edge-Connectivity of Product Graphs

open access: yesDiscussiones Mathematicae Graph Theory, 2016
The generalized k-connectivity κk(G) of a graph G was introduced by Hager in 1985. As a natural counterpart of this concept, Li et al. in 2011 introduced the concept of generalized k-edge-connectivity which is defined as λk(G) = min{λ(S) : S ⊆ V (G) and |
Sun Yuefang
doaj   +1 more source

Therapeutic Apheresis in Nigeria: A Multi‐Center Summary of Abstracts From the Inaugural Nigerian Society for Apheresis Scientific Meeting

open access: yesTherapeutic Apheresis and Dialysis, EarlyView.
ABSTRACT Background Therapeutic apheresis (TA) is an established treatment modality for hematologic, neurologic, and immunologic disorders, yet access remains severely limited in sub‐Saharan Africa. Donor apheresis, including platelet apheresis collection from healthy donors, represents an important complementary modality supporting blood product ...
Nosa Bazuaye   +33 more
wiley   +1 more source

2-Tone Colorings in Graph Products

open access: yesDiscussiones Mathematicae Graph Theory, 2015
A variation of graph coloring known as a t-tone k-coloring assigns a set of t colors to each vertex of a graph from the set {1, . . . , k}, where the sets of colors assigned to any two vertices distance d apart share fewer than d colors in common.
Loe Jennifer   +3 more
doaj   +1 more source

NZ‐flows in strong products of graphs

open access: yesJournal of Graph Theory, 2010
AbstractWe prove that the strong product G1⊠ G2 of G1 and G2 is ℤ3‐flow contractible if and only if G1⊠ G2 is not T⊠ K2, where T is a tree (we call T⊠ K2 a K4‐tree). It follows that G1⊠ G2 admits an NZ 3 ‐flow unless G1⊠ G2 is a K4 ‐tree. We also give a constructive proof that yields a polynomial algorithm whose output is an NZ 3‐flow if G1⊠ G2 is not ...
Wilfried Imrich   +3 more
openaire   +3 more sources

Establishing an Apheresis Medicine Program in a Resource‐Constrained Setting: A 5‐Year Experience From Lagos, Nigeria

open access: yesTherapeutic Apheresis and Dialysis, EarlyView.
ABSTRACT Background Establishing a comprehensive apheresis medicine program in a resource‐constrained setting presents significant structural, financial, and logistical challenges. Despite the growing clinical importance of apheresis services globally, published experience from sub‐Saharan Africa remains sparse.
Folasade Adelekan‐Popoola   +4 more
wiley   +1 more source

若干运算图的倍乘赋权Harary指标(Multiplicatively weighted Harary index of some graph operations)

open access: yesZhejiang Daxue xuebao. Lixue ban, 2017
Recently, ALIZADEH et al proposed a modification of the Harary index in which the contributions of vertex pairs were weighted by the product of their degrees.
WENYanqing(温艳清)   +2 more
doaj   +1 more source

Fast recognition of direct and strong products

open access: yesArs Mathematica Contemporanea, 2014
Summary: This note describes fast algorithms for computing the prime factors of connected, nonbipartite graphs with respect to the direct product, and of connected graphs with respect to the strong product. The complexities are \(O(m \min(n^{2} {\Delta}^{3}))\) for the direct product, and \(O(m\,a(G) \Delta)\) for the strong, where \(n\) is the order ...
Hammack, Richard H., Imrich, Wilfried
openaire   +4 more sources

Serum Myonectin Levels Are Positively Associated With Physical Function and Lower Frailty‐Related Limitation in Maintenance Hemodialysis Patients: A Cross‐Sectional Study

open access: yesTherapeutic Apheresis and Dialysis, EarlyView.
ABSTRACT Background Maintenance hemodialysis (MHD) patients frequently suffer from frailty, characterized by reduced physical function and poor prognosis. Myokines, such as myonectin, secreted by muscle, are emerging regulators of systemic health. This study investigated the relationship between serum myonectin, adipokines (adiponectin, omentin), and ...
Kenichi Kono   +7 more
wiley   +1 more source

Home - About - Disclaimer - Privacy