Results 111 to 120 of about 3,489,698 (302)
Complete graph immersions in dense graphs [PDF]
In this article we consider the relationship between vertex coloring and the immersion order. Specifically, a conjecture proposed by Abu-Khzam and Langston in 2003, which says that the complete graph with $t$ vertices can be immersed in any $t$-chromatic graph, is studied.
openaire +4 more sources
Tumour‐proximal deep serum proteomics identifies biomarkers associated with ovarian cancer
New biomarkers are needed for early ovarian cancer detection. Ovarian (tumour‐proximal) and peripheral vein serum from healthy women and patients with benign or malignant tumours underwent nanoparticle‐enriched deep proteomics. Ovarian serum yielded more protein identifications and revealed tumour‐reflective signatures.
Darren Lau +9 more
wiley +1 more source
Modularity of nearly complete graphs and bipartite graphs [PDF]
It is known that complete graphs and complete multipartite graphs have modularity zero. We show that the least number of edges we may delete from the complete graph $K_n$ to obtain a graph with non-zero modularity is $\lfloor n/2\rfloor +1$. Similarly we
Skerman, Fiona, McDiarmid, Colin
core
Cisplatin‐resistant cancer cells survive DNA‐damaging platinum‐based treatment yet remain sensitive to CuET‐induced proteotoxic stress. The distinct mechanism of action allows CuET to overcome and eliminate cisplatin‐resistant tumour cells, unless highly expressed metallothioneins (MTs) interfere with CuET, thereby highlighting MT levels as candidate ...
Stefanos Arampatzis +20 more
wiley +1 more source
Converting Tessellations into Graphs: From Voronoi Tessellations to Complete Graphs
A mathematical procedure enabling the transformation of an arbitrary tessellation of a surface into a bi-colored, complete graph is introduced. Polygons constituting the tessellation are represented by vertices of the graphs.
Artem Gilevich +4 more
doaj +1 more source
Decompositions of Complete Multipartite Graphs into Complete Graphs
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
The cytoskeleton‐mediated transport of mitochondria via tunnelling nanotubes restores respiration, increases ATP production, rescues cells from apoptosis, activates the AKT/mTOR signalling pathway, promotes cell migration and invasiveness, contributes to cancer progression and treatment resistance.
Stanislava Martínková, Jan Trnka
wiley +1 more source
Repair of neuronal DNA damage in Alzheimer's disease by KCL‐286. (A) Amyloid‐β oligomers and plaques impair neuronal DNA repair pathways, leading to DNA double‐strand breaks and glial activation. (B) KCL‐286 activates RARβ/RXR signalling via retinoic acid response elements (RAREs), associated with increased BRCA1 expression, enhanced DNA repair and ...
Natasha Hill +6 more
wiley +1 more source
Topological drawings of complete bipartite graphs
Topological drawings are natural representations of graphs in the plane, where vertices are represented by points, and edges by curves connecting the points.
Jean Cardinal, Stefan Felsner
doaj +1 more source
Completely connected clustered graphs
A clustered graph \((G,T,r)\) consists of a graph \(G=(V,E)\), a tree \(T\), and an inner vertex \(r\) of \(T\) such that the set of leaves of \(T\) is exactly \(V\). A clustered graph is said to be completely connected if every cluster, and also each complement of a cluster, induces a connected subgraph.
Sabine Cornelsen, Dorothea Wagner
openaire +3 more sources

