Results 1 to 10 of about 971 (113)
Comparison of open-source software for producing directed acyclic graphs [PDF]
Journal of Causal InferenceMany software packages have been developed to assist researchers in drawing directed acyclic graphs (DAGs), each with unique functionality and usability. We examine five of the most common software to generate DAGs: TikZ, DAGitty, ggdag, dagR, and igraph.
Pitts Amy J., Fowler Charlotte R.
doaj +2 more sources
A mathematical model of whole-body potassium regulation: Global parameter sensitivity analysis*
bioRxiv, 2023 Potassium (K+) is an essential electrolyte that is tightly regulated by various complex physiological mechanisms. In this study, we analyze a mathematical model of whole-body K+ regulation to investigate the sensitivity of different model outcomes to ...
M. Stadt, Anita T. Layton
semanticscholar +1 more source
Computing Minimum Rainbow and Strong Rainbow Colorings of Block Graphs [PDF]
Discrete Mathematics & Theoretical Computer Science, 2018 A path in an edge-colored graph $G$ is rainbow if no two edges of it are colored the same. The graph $G$ is rainbow-connected if there is a rainbow path between every pair of vertices.
Melissa Keranen, Juho Lauri
doaj +1 more source
(C3, C4, C5, C7)-Free Almost Well-Dominated Graphs
Discussiones Mathematicae Graph Theory, 2022 The domination gap of a graph G is defined as the di erence between the maximum and minimum cardinalities of a minimal dominating set in G. The term well-dominated graphs referring to the graphs with domination gap zero, was first introduced by Finbow et
Alizadeh Hadi +2 more
doaj +1 more source
More on the Rainbow Disconnection in Graphs
Discussiones Mathematicae Graph Theory, 2022 Let G be a nontrivial edge-colored connected graph. An edge-cut R of G is called a rainbow-cut if no two of its edges are colored the same. An edge-colored graph G is rainbow disconnected if for every two vertices u and v of G, there exists a u-v-rainbow-
Bai Xuqing +3 more
doaj +1 more source
Lefschetz fixed point theorem for digital images
Fixed Point Theory and Applications, 2013 In this article we study the fixed point properties of digital images. Moreover, we prove the Lefschetz fixed point theorem for a digital image. We then give some examples about the fixed point property.
Ozgur Ege, Ismet Karaca
semanticscholar +2 more sources
The 2-colouring problem for $(m,n)$-mixed graphs with switching is polynomial [PDF]
Discrete Mathematics & Theoretical Computer Science, 2022 A mixed graph is a set of vertices together with an edge set and an arc set. An $(m,n)$-mixed graph $G$ is a mixed graph whose edges are each assigned one of $m$ colours, and whose arcs are each assigned one of $n$ colours. A \emph{switch} at a vertex $v$
Richard C Brewster +2 more
doaj +1 more source
The Compared Costs of Domination Location-Domination and Identification
Discussiones Mathematicae Graph Theory, 2020 Let G = (V, E) be a finite graph and r ≥ 1 be an integer. For v ∈ V, let Br(v) = {x ∈ V : d(v, x) ≤ r} be the ball of radius r centered at v. A set C ⊆ V is an r-dominating code if for all v ∈ V, we have Br(v) ∩ C ≠ ∅; it is an r-locating-dominating code
Hudry Olivier, Lobstein Antoine
doaj +1 more source
Graph Classes Generated by Mycielskians
Discussiones Mathematicae Graph Theory, 2020 In this paper we use the classical notion of weak Mycielskian M′(G) of a graph G and the following sequence: M′0(G) = G, M′1(G) = M′(G), and M′n(G) = M′(M′n−1(G)), to show that if G is a complete graph of order p, then the above sequence is a generator ...
Borowiecki Mieczys law +3 more
doaj +1 more source
The construction of simplicial groups in digital images
Journal of Inequalities and Applications, 2013 In this paper, we recall some definitions and properties from digital topology, and we consider the simplices and simplicial complexes in digital images due to adjacency relations.
Simge Öztunç, N. Bildik, A. Mutlu
semanticscholar +2 more sources