Results 21 to 30 of about 76,267 (236)

On local antimagic vertex coloring of corona products related to friendship and fan graph

open access: yesIndonesian Journal of Combinatorics, 2021
Let G=(V,E) be connected graph. A bijection f : E → {1,2,3,..., |E|} is a local antimagic of G if any adjacent vertices u,v ∈ V satisfies w(u)≠ w(v), where w(u)=∑e∈E(u) f(e), E(u) is the set of edges incident to u. When vertex u is assigned the color w(u)
Zein Rasyid Himami, Denny Riama Silaban
doaj   +1 more source

Properties of metabolic graphs: biological organization or representation artifacts?

open access: yesBMC Bioinformatics, 2011
Background Standard graphs, where each edge links two nodes, have been extensively used to represent the connectivity of metabolic networks. It is based on this representation that properties of metabolic networks, such as hierarchical and small-world ...
Nakhleh Luay, Zhou Wanding
doaj   +1 more source

Graphlet correlation distance to compare small graphs

open access: yesPLoS ONE, 2023
Graph models are standard for representing mutual relationships between sets of entities. Often, graphs deal with a large number of entities with a small number of connections (e.g. social media relationships, infectious disease spread). The distances or
Jérôme Roux   +4 more
doaj   +2 more sources

A hidden Markov tree model for testing multiple hypotheses corresponding to Gene Ontology gene sets

open access: yesBMC Bioinformatics, 2018
Background Testing predefined gene categories has become a common practice for scientists analyzing high throughput transcriptome data. A systematic way of testing gene categories leads to testing hundreds of null hypotheses that correspond to nodes in a
Kun Liang   +3 more
doaj   +1 more source

Efficient Tuning-Free l1-Regression of Nonnegative Compressible Signals

open access: yesFrontiers in Applied Mathematics and Statistics, 2021
In compressed sensing the goal is to recover a signal from as few as possible noisy, linear measurements with the general assumption that the signal has only a few non-zero entries.
Hendrik Bernd Petersen   +3 more
doaj   +1 more source

An MBO method for modularity optimisation based on total variation and signless total variation

open access: yesEuropean Journal of Applied Mathematics
In network science, one of the significant and challenging subjects is the detection of communities. Modularity [1] is a measure of community structure that compares connectivity in the network with the expected connectivity in a graph sampled from a ...
Zijun Li, Yves van Gennip, Volker John
doaj   +1 more source

Scale-resolved analysis of brain functional connectivity networks with spectral entropy

open access: yesNeuroImage, 2020
Functional connectivity is derived from inter-regional correlations in spontaneous fluctuations of brain activity, and can be represented in terms of complete graphs with continuous (real-valued) edges.
Carlo Nicolini   +3 more
doaj   +1 more source

Configuration models as an urn problem

open access: yesScientific Reports, 2021
A fundamental issue of network data science is the ability to discern observed features that can be expected at random from those beyond such expectations. Configuration models play a crucial role there, allowing us to compare observations against degree-
Giona Casiraghi, Vahan Nanumyan
doaj   +1 more source

Ergothioneine supplementation improves pup phenotype and survival in a murine model of spinal muscular atrophy

open access: yesFEBS Letters, EarlyView.
Spinal muscular atrophy (SMA) is a genetic disease affecting motor neurons. Individuals with SMA experience mitochondrial dysfunction and oxidative stress. The aim of the study was to investigate the effect of an antioxidant and neuroprotective substance, ergothioneine (ERGO), on an SMNΔ7 mouse model of SMA.
Francesca Cadile   +8 more
wiley   +1 more source

Subgraph Covers: An Information-Theoretic Approach to Motif Analysis in Networks

open access: yesPhysical Review X, 2014
Many real-world networks contain a statistically surprising number of certain subgraphs, called network motifs. In the prevalent approach to motif analysis, network motifs are detected by comparing subgraph frequencies in the original network with a ...
Anatol E. Wegner
doaj   +1 more source

Home - About - Disclaimer - Privacy