Results 41 to 50 of about 1,691,893 (274)
The Reliability of a Class of Two-Layer Networks with Unreliable Edges
AxiomsIt is well known that networks are dynamic graphs, and the topology of a network can be described by a graph. Thus, the reliability of a network under edge failure is defined as the probability that its corresponding topological graph remains connected ...
Sun Xie, Haixing Zhao, Jun Yin
doaj +1 more source
Decompositions of Complete Multipartite Graphs into Complete Graphs
, 2011 Let $k\geq\ell\geq1$ and $n\geq 1$ be integers. Let $G(k,n)$ be the complete $k$-partite graph with $n$ vertices in each colour class. An $\ell$-decomposition of $G(k,n)$ is a set $X$ of copies of $K_k$ in $G(k,n)$ such that each copy of $K_\ell$ in $G(k,n)$ is a subgraph of exactly one copy of $K_k$ in $X$. This paper asks: when does $G(k,n)$ have an $
Fabila-Monroy, Ruy, Wood, David R.
openaire +2 more sources
GCD-graphs and NEPS of complete graphs
Ars Mathematica Contemporanea, 2012 A gcd-graph is a Cayley graph over a finite abelian group defined by greatest common divisors. Such graphs are known to have integral spectrum. A non-complete extended p-sum, or NEPS in short, is well-known general graph product. We show that the class of gcd-graphs and the class of NEPS of complete graphs coincide.
Klotz, Walter, Sander, Torsten
openaire +3 more sources
Therapeutic Apheresis and Dialysis, EarlyView.ABSTRACT Introduction Bloodstream infections due to repeated vascular access (VA) puncture and circuit connections remain major concerns in hemodialysis. Therefore, we examined current practices for glove, disinfectant, and personal protective equipment (PPE) use according to VA type in national university hospitals in Japan.
Aiko Yamada +6 more
wiley +1 more source
One-factorizations of the complete graph $K_{p+1}$ arising from parabolas
Theory and Applications of Graphs, 2022 There are three types of affine regular polygons in AG(2, q): ellipse, hyperbola and parabola. The first two cases have been investigated in previous papers.
György Kiss +2 more
doaj +1 more source
Generalized Tur\'an problems for disjoint copies of graphs
, 2018 Given two graphs $H$ and $F$, the maximum possible number of copies of $H$ in an $F$-free graph on $n$ vertices is denoted by $ex(n,H,F)$. We investigate the function $ex(n,H,kF)$, where $kF$ denotes $k$ vertex disjoint copies of a fixed graph $F$.
Gerbner, Dániel +2 more
core +1 more source
FEBS Letters, EarlyView.We identified a systemic, progressive loss of protein S‐glutathionylation—detected by nonreducing western blotting—alongside dysregulation of glutathione‐cycle enzymes in both neuronal and peripheral tissues of Taiwanese SMA mice. These alterations were partially rescued by SMN antisense oligonucleotide therapy, revealing persistent redox imbalance as ...
Sofia Vrettou, Brunhilde Wirth
wiley +1 more source
Statistical Properties of SIS Processes with Heterogeneous Nodal Recovery Rates in Networks
Applied SciencesThe modeling and analysis of epidemic processes in networks have attracted much attention over the past few decades. A major underlying assumption is that the recovery process and infection process are homogeneous, allowing the associated theoretical ...
Dongchao Guo, Libo Jiao, Wendi Feng
doaj +1 more source
Signed Complete Graphs with Maximum Index
Discussiones Mathematicae Graph Theory, 2020 Let Γ = (G, σ) be a signed graph, where G is the underlying simple graph and σ E(G) → {−, +} is the sign function on the edges of G. The adjacency matrix of a signed graph has −1 or +1 for adjacent vertices, depending on the sign of the edges.
Akbari Saieed +3 more
doaj +1 more source
Dimensi Metrik Kuat Lokal Graf Hasil Operasi Kali Kartesian
Contemporary Mathematics and Applications (ConMathA), 2020 The strong local metric dimension is the development result of a strong metric dimension study, one of the study topics in graph theory. Some of graphs that have been discovered about strong local metric dimension are path graph, star graph, complete ...
Nurma Ariska Sutardji +2 more
doaj +1 more source