Results 61 to 70 of about 8,504,362 (373)

Hausdorff of a cycle in topological graph

open access: yesBoletim da Sociedade Paranaense de Matemática, 2022
The main purpose of the paper is to bring together two areas in which strong relation, graph theory and topological spaces. And derive interesting formula for the set that contains all minimal dominating sets(MDS) and ( -set). Some separation axioms are
Ali Ameer Jabor, Ahmed Abd-Ali Omran
doaj   +1 more source

Sampling and Reconstruction of Sparse Signals on Circulant Graphs - An Introduction to Graph-FRI

open access: yes, 2017
With the objective of employing graphs toward a more generalized theory of signal processing, we present a novel sampling framework for (wavelet-)sparse signals defined on circulant graphs which extends basic properties of Finite Rate of Innovation (FRI)
Dragotti, Pier Luigi   +1 more
core   +1 more source

A histidine‐rich extension of the mitochondrial F0 subunit ATP6 from the ice worm Mesenchytraeus solifugus increases ATP synthase activity in bacteria

open access: yesFEBS Letters, EarlyView.
The glacier ice worm Mesenchytraeus solifugus survives year‐round at 0 °C. Its ATP6 subunit, which forms a regulatory component of the proton pore in mitochondrial ATP synthase, has a carboxy‐terminal extension not found in any other organism examined to date. Here, we show that fusion of this extension to the homologous AtpB protein in E. coli results
Truman Dunkley   +2 more
wiley   +1 more source

Distance antimagic labeling of circulant graphs

open access: yesAIMS Mathematics
A distance antimagic labeling of graph $ G = (V, E) $ of order $ n $ is a bijection $ f:V(G)\rightarrow \{1, 2, \ldots, n\} $ with the property that any two distinct vertices $ x $ and $ y $ satisfy $ \omega(x)\ne\omega(y) $, where $ \omega(x) $ denotes ...
Syafrizal Sy   +4 more
doaj   +1 more source

Universal graphs for the topological minor relation [PDF]

open access: yesarXiv, 2022
A subgraph-universal graph/a topological minor-universal graph in a class of graphs $\mathcal{G}$ is a graph in $\mathcal{G}$ which contains every graph in $\mathcal{G}$ as a subgraph/topological minor. We prove that the class $\mathcal{P}$ of all countable planar graphs does not contain a topological minor-universal graph.
arxiv  

Distinct dysregulated pathways in sporadic and Lynch syndrome‐associated colorectal cancer offer insights for targeted treatment

open access: yesFEBS Letters, EarlyView.
This study explores the distinct molecular mechanisms underlying Lynch syndrome‐associated and sporadic colorectal cancer (CRC). By highlighting the therapeutic potential of targeting the PI3K‐Akt pathway in Lynch syndrome‐associated CRC and the Wnt pathway in sporadic CRC, the findings open avenues for personalised treatment strategies, aiming to ...
May J. Krause   +2 more
wiley   +1 more source

Research in structural graph theory [PDF]

open access: yes, 2009
Issued as final reportNational Science Foundation (U.S.
Thomas, Robin
core  

Identification of functional and diverse circulating cancer‐associated fibroblasts in metastatic castration‐naïve prostate cancer patients

open access: yesMolecular Oncology, EarlyView.
Cancer‐associated fibroblasts (CAFs) promote cancer growth, invasion (metastasis), and drug resistance. Here, we identified functional and diverse circulating CAFs (cCAFs) in patients with metastatic prostate cancer (mPCa). cCAFs were found in higher numbers and were functional and diverse in mPCa patients versus healthy individuals, suggesting their ...
Richell Booijink   +6 more
wiley   +1 more source

Graph-Based Analysis of Brain Connectivity in Multiple Sclerosis Using Functional MRI: A Systematic Review

open access: yesBrain Sciences, 2023
(1) Background: Multiple sclerosis (MS) is an immune system disease in which myelin in the nervous system is affected. This abnormal immune system mechanism causes physical disabilities and cognitive impairment.
Sara Hejazi   +4 more
doaj   +1 more source

Problems in extremal graph theory [PDF]

open access: yes, 2010
We consider a variety of problems in extremal graph and set theory. The {\em chromatic number} of $G$, $\chi(G)$, is the smallest integer $k$ such that $G$ is $k$-colorable.
Ozkahya, Lale
core  

Home - About - Disclaimer - Privacy