Results 51 to 60 of about 1,312,788 (294)

Ideal Graph of a Graph [PDF]

open access: yes, 2011
In this paper, we introduce ideal graph of a graph and study some of its properties. We characterize connectedness, isomorphism of graphs and coloring property of a graph using ideal graph.
Manoharan, R., Vasuki, R.
core   +1 more source

Microbiome‐blood–brain barrier interactions in aging — mechanisms and therapeutic potential

open access: yesFEBS Letters, EarlyView.
Aging reshapes the gut microbiome (↓SCFA‐producing commensals; ↑pro‐inflammatory outputs), shifting circulating metabolites (↓SCFAs; ↑LPS, ↑TMAO, ↑PAA) that act at the BBB to increase nonspecific transcytosis, alter transport, and promote astrocyte reactivity, heightening brain vulnerability.
Daniel Cuervo‐Zanatta   +3 more
wiley   +1 more source

On H-irregularity strengths of G-amalgamation of graphs

open access: yesElectronic Journal of Graph Theory and Applications, 2017
A simple graph G=(V(G),E(G)) admits an H-covering if every edge in E(G) belongs at least to one subgraph of G isomorphic to a given graph H. Then the graph G admitting H-covering admits an H-irregular total k-labeling f: V(G) U E(G) \to {1, 2, ..., k} if
Faraha Ashraf   +3 more
doaj   +1 more source

On the Adjacent Eccentric Distance Sum Index of Graphs. [PDF]

open access: yesPLoS ONE, 2015
For a given graph G, ε(v) and deg(v) denote the eccentricity and the degree of the vertex v in G, respectively. The adjacent eccentric distance sum index of a graph G is defined as [Formula in text], where [Formula in text] is the sum of all distances ...
Hui Qu, Shujuan Cao
doaj   +1 more source

Towards a Maude tool for model checking temporal graph properties [PDF]

open access: yes, 2011
We present our prototypical tool for the verification of graph transformation systems. The major novelty of our tool is that it provides a model checker for temporal graph properties based on counterpart semantics for quantified m-calculi.
Lluch-Lafuente, Alberto   +4 more
core   +1 more source

Functional comparison of EncB and EncC cargo proteins in iron storage within the Myxococcus xanthus encapsulin

open access: yesFEBS Letters, EarlyView.
Encapsulins are protein nanocompartments that play an important role in iron storage. In the Myxococcus xanthus encapsulin system, two cargo proteins called EncB and EncC contribute to iron mineralization. Here, we show that EncB and EncC generate iron‐containing minerals with distinct chemical compositions, suggesting that the composition of stored ...
Harry B. McDowell   +2 more
wiley   +1 more source

Finding novel vulnerabilities of hypomorphic BRCA1 alleles

open access: yesMolecular Oncology, EarlyView.
Synthetic lethality screens performed to identify novel vulnerabilities often model complete gene loss, thereby overlooking patient‐derived hypomorphic mutations. In this study, we have performed genome‐wide CRISPR screens on BRCA1 hypomorphic mutations, showing BRCA1I26A behaves like wild‐type, while BRCA1R1699Q mimics deficiency. Furthermore, we have
Anne Schreuder   +10 more
wiley   +1 more source

Subgraph-Indexed Sequential Subdivision for Continuous Subgraph Matching on Dynamic Knowledge Graph

open access: yesComplexity, 2020
Continuous subgraph matching problem on dynamic graph has become a popular research topic in the field of graph analysis, which has a wide range of applications including information retrieval and community detection. Specifically, given a query graph q,
Yunhao Sun   +3 more
doaj   +1 more source

Graph Cover-Saturation

open access: yesGraphs and Combinatorics, 2019
10 pages, 7 ...
openaire   +3 more sources

Partial covers of graphs

open access: yesDiscussiones Mathematicae Graph Theory, 2002
A mapping \(f\) of the vertices of graph \(G\) to the vertices of graph \(H\) is a homomorphism if \((f(u),f(v))\) is an edge of \(H\) for every edge \((u,v)\) of \(G\). This paper studies partial covers: these are homomorphisms that are `locally injective', and generalize the notion of graph cover.
Jirí Fiala 0001, Jan Kratochvíl
openaire   +2 more sources

Home - About - Disclaimer - Privacy