Results 51 to 60 of about 2,686,069 (331)

Cospectrality graphs of Smith graphs

open access: yesFilomat, 2019
Graphs whose spectrum belongs to the interval [-2,2] are called Smith graphs. The structure of a Smith graph with a given spectrum depends on a system of Diophantine linear algebraic equations. We have established in [1] several properties of this system and showed how it can be simplified and effectively applied.
Cvetković, Dragoš, Todorčević, Vesna
openaire   +4 more sources

Resolvent of Large Random Graphs

open access: yes, 2009
We analyze the convergence of the spectrum of large random graphs to the spectrum of a limit infinite graph. We apply these results to graphs converging locally to trees and derive a new formula for the Stieljes transform of the spectral measure of such ...
Aldous   +31 more
core   +4 more sources

A Comparative Study of Cerebral Oxygenation During Exercise in Hemodialysis and Peritoneal Dialysis Patients

open access: yesTherapeutic Apheresis and Dialysis, EarlyView.
ABSTRACT Introduction Cognitive impairment and exercise intolerance are common in dialysis patients. Cerebral perfusion and oxygenation play a major role in both cognitive function and exercise execution; HD session per se aggravates cerebral ischemia in this population. This study aimed to compare cerebral oxygenation and perfusion at rest and in mild
Marieta P. Theodorakopoulou   +10 more
wiley   +1 more source

Random graphs from a weighted minor-closed class [PDF]

open access: yes, 2012
There has been much recent interest in random graphs sampled uniformly from the n-vertex graphs in a suitable minor-closed class, such as the class of all planar graphs.
McDiarmid, Colin
core  

On P-transitive graphs and applications

open access: yes, 2011
We introduce a new class of graphs which we call P-transitive graphs, lying between transitive and 3-transitive graphs. First we show that the analogue of de Jongh-Sambin Theorem is false for wellfounded P-transitive graphs; then we show that the mu ...
Giacomo Lenzi   +2 more
core   +2 more sources

Enteropathogenic E. coli shows delayed attachment and host response in human jejunum organoid‐derived monolayers compared to HeLa cells

open access: yesFEBS Letters, EarlyView.
Enteropathogenic E. coli (EPEC) infects the human intestinal epithelium, resulting in severe illness and diarrhoea. In this study, we compared the infection of cancer‐derived cell lines with human organoid‐derived models of the small intestine. We observed a delayed in attachment, inflammation and cell death on primary cells, indicating that host ...
Mastura Neyazi   +5 more
wiley   +1 more source

The Interpreting Ability on Science Kinematics Graphs of Senior High School Students in South Sulawesi, Indonesia

open access: yesJurnal Pendidikan IPA Indonesia, 2020
This research was a descriptive case study. The purpose of this research was to describe the student’s ability to interpret the kinematics graph. The subjects of the study were 347 students of class XI science in the even semester of 2018/2019 in Luwu ...
B. D. Amin   +5 more
doaj   +1 more source

On edge-group choosability of graphs [PDF]

open access: yes, 2011
In this paper, we study the concept of edge-group choosability of graphs. We say that G is edge k-group choosable if its line graph is k-group choosable. An edge-group choosability version of Vizing conjecture is given.
Khamseh, Amir, Omidi, Gholamreza
core  

The Caenorhabditis elegans DPF‐3 and human DPP4 have tripeptidyl peptidase activity

open access: yesFEBS Letters, EarlyView.
The dipeptidyl peptidase IV (DPPIV) family comprises serine proteases classically defined by their ability to remove dipeptides from the N‐termini of substrates, a feature that gave the family its name. Here, we report the discovery of a previously unrecognized tripeptidyl peptidase activity in DPPIV family members from two different species.
Aditya Trivedi, Rajani Kanth Gudipati
wiley   +1 more source

A complete classification of which $(n,k)$-star graphs are Cayley graphs

open access: yes, 2017
The $(n,k)$-star graphs are an important class of interconnection networks that generalize star graphs, which are superior to hypercubes. In this paper, we continue the work begun by Cheng et al.~(Graphs and Combinatorics 2017) and complete the ...
Cheng, Eddie   +4 more
core   +1 more source

Home - About - Disclaimer - Privacy