Results 61 to 70 of about 1,519,388 (324)
On local antimagic vertex coloring of corona products related to friendship and fan graph
Indonesian 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
Bad Communities with High Modularity [PDF]
, 2013 In this paper we discuss some problematic aspects of Newman's modularity function QN. Given a graph G, the modularity of G can be written as QN = Qf -Q0, where Qf is the intracluster edge fraction of G and Q0 is the expected intracluster edge fraction of
Kehagias, Athanasios +1 more
core +2 more sources
Graphlet correlation distance to compare small graphs
PLoS 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
BMC 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
Examples of scalar-flat hypersurfaces in $\mathbb{R}^{n+1}$
, 2008 Given a hypersurface $M$ of null scalar curvature in the unit sphere $\mathbb{S}^n$, $n\ge 4$, such that its second fundamental form has rank greater than 2, we construct a singular scalar-flat hypersurface in $\Rr^{n+1}$ as a normal graph over a ...
de Lira, Jorge H. S., Soret, Marc
core +2 more sources
Geometry of normal graphs in Euclidean space and applications to the Penrose inequality in Minkowski [PDF]
, 2013 The Penrose inequality in Minkowski is a geometric inequality relating the total outer null expansion and the area of closed, connected and spacelike codimension-two surfaces S in the Minkowski spacetime, subject to an additional convexity assumption. In
Mars, Marc, Soria, Alberto
core +1 more source
HERMES: PERSISTENT SPECTRAL GRAPH SOFTWARE. [PDF]
Foundations of Data Science, 2020 Persistent homology (PH) is one of the most popular tools in topological data analysis (TDA), while graph theory has had a significant impact on data science.
Rui Wang +5 more
semanticscholar +1 more source
An MBO method for modularity optimisation based on total variation and signless total variation
European Journal of Applied MathematicsIn 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
Efficient Tuning-Free l1-Regression of Nonnegative Compressible Signals
Frontiers 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
Spanning Trees in Random Satisfiability Problems
, 2006 Working with tree graphs is always easier than with loopy ones and spanning trees are the closest tree-like structures to a given graph. We find a correspondence between the solutions of random K-satisfiability problem and those of spanning trees in the ...
A Ramezanpour +6 more
core +1 more source