Results 91 to 100 of about 2,991,925 (319)
New Bounds For Degree Sequence Of Graphs [PDF]
Let $G = (V, E)$ be a simple graph with $n$ vertices, $m$ edges, and vertex degrees $d_1, d_2, ..., d_n$. Let $d_1, d_n$ be the maximum and and minimum degree of vertices. In this paper, we present lower and upper bounds for $\sum_{i=1}^{n}d_i^{2}$ and
Akbar Jahanbani
doaj
A permutation method for network assembly.
We present a method for assembling directed networks given a prescribed bi-degree (in- and out-degree) sequence. This method utilises permutations of initial adjacency matrix assemblies that conform to the prescribed in-degree sequence, yet violate the ...
Shawn A Means +2 more
doaj +1 more source
Antimicrobial resistance (AMR) is of huge importance, resulting in over 1 million deaths each year. Here, we describe how a new drug, enmetazobactam, designed to help fight resistant bacterial diseases, inhibits a key enzyme (GES‐1) responsible for AMR. Our data show it is a more potent inhibitor than the related tazobactam, with high‐level computation
Michael Beer +10 more
wiley +1 more source
Degree sequences of random graphs
AbstractThe paper sets out to investigate the degree sequences d1⩾d2⩾…⩾dn of random graphs of order n in which the edges are chosen independently and with the same probability p ...
openaire +3 more sources
Degree sequence and supereulerian graphs [PDF]
AbstractA sequence d=(d1,d2,…,dn) is graphic if there is a simple graph G with degree sequence d, and such a graph G is called a realization of d. A graphic sequence d is line-hamiltonian if d has a realization G such that L(G) is hamiltonian, and is supereulerian if d has a realization G with a spanning eulerian subgraph.
Hong-Jian Lai +4 more
openaire +1 more source
Mutations in the C9orf72 gene represent the most common genetic cause of amyotrophic lateral sclerosis (ALS), a fatal neurodegenerative disease. Using patient‐derived neurons and C. elegans models, we find that the nucleoporin Nup107 is dysregulated in C9orf72‐associated ALS. Conversely, reducing Nup107 levels mitigates disease‐related changes.
Saygın Bilican +7 more
wiley +1 more source
A Note on Degree Sequences of Graphs [PDF]
AbstractSufficient conditions for a sequence of numbers to be the degree sequence of a graph are derived from the Erdos-Gallai theorem on degree sequences of graphs.
openaire +3 more sources
Novel and unscrutinized immune entities of the zebrafish gut
Understudied cells of the zebrafish immune system include bona fide immune cells and epithelial (‐derived) cells with immune functions. Research focusing on zebrafish cells which demonstrate similarities to mammalian immune cell counterparts may help us understand the pathologies in which they are implicated. Currently available and advanced tools make
Audrey Inge Schytz Andersen‐Civil +5 more
wiley +1 more source
Degree-based connected graph construction with assortativity constraint
Degree-based graph construction is a fundamental problem in network science. A graph is simple if there are no self-loops and no multiple links between any pair of nodes in the graph. A degree sequence $d = (d_1, d_2,\cdots, d_{N})$ is graphical if d can
Yingyue Ke, Piet Van Mieghem
doaj +1 more source
Single‐cell RNA sequencing reveals an opposite role of SLPI in basal tumors based on metastatic spread, along with shared activation of specific regulons in cancer cells and mature luminal lactocytes, as well as downregulation of MALAT1 and NEAT1 in the latter.
Pietro Ancona +4 more
wiley +1 more source

