Results 21 to 30 of about 730 (100)
Corrigendum to "On the monophonic rank of a graph" [Discrete Math. Theor. Comput. Sci. 24:2 (2022) #3] [PDF]
Discrete Mathematics & Theoretical Computer ScienceIn this corrigendum, we give a counterexample to Theorem 5.2 in "On the monophonic rank of a graph" [Discrete Math. Theor. Comput. Sci. 24:2 (2022) #3]. We also present a polynomial-time algorithm for computing the monophonic rank of a starlike
Mitre C. Dourado +2 more
doaj +1 more source
Geometric medians in reconciliation spaces [PDF]
, 2017 In evolutionary biology, it is common to study how various entities evolve together, for example, how parasites coevolve with their host, or genes with their species.
Huber, Katharina T. +3 more
core +5 more sources
, 2012 Let k be an algebraically closed field and α, β, γ be partitions. An algebraic group acts on the constructible set of short exact sequences of nilpotent k-linear operators of Jordan types α, β, and γ, respectively; we are interested in the stratification
J. Kosakowska, M. Schmidmeier
semanticscholar +1 more source
A Linear Kernel for Planar Total Dominating Set [PDF]
Discrete Mathematics & Theoretical Computer Science, 2018 A total dominating set of a graph $G=(V,E)$ is a subset $D \subseteq V$ such that every vertex in $V$ is adjacent to some vertex in $D$. Finding a total dominating set of minimum size is NP-hard on planar graphs and W[2]-complete on general graphs when ...
Valentin Garnero, Ignasi Sau
doaj +1 more source
Improved kernels for Signed Max Cut parameterized above lower bound on (r,l)-graphs [PDF]
Discrete Mathematics & Theoretical Computer Science, 2017 A graph $G$ is signed if each edge is assigned $+$ or $-$. A signed graph is balanced if there is a bipartition of its vertex set such that an edge has sign $-$ if and only if its endpoints are in different parts.
Luerbio Faria +3 more
doaj +1 more source
A version of Herbert A. Simon's model with slowly fading memory and its connections to branching processes [PDF]
, 2019 Construct recursively a long string of words w1. .. wn, such that at each step k, w k+1 is a new word with a fixed probability p $\in$ (0, 1), and repeats some preceding word with complementary probability 1 -- p.
Bertoin, Jean
core +1 more source
Soft covering based rough graphs and corresponding decision making
Open Mathematics, 2019 Soft set theory and rough set theory are two new tools to discuss uncertainty. Graph theory is a nice way to depict certain information. Particularly soft graphs serve the purpose beautifully.
Park Choonkil +5 more
doaj +1 more source
Irreversible 2-conversion set in graphs of bounded degree [PDF]
Discrete Mathematics & Theoretical Computer Science, 2017 An irreversible $k$-threshold process (also a $k$-neighbor bootstrap percolation) is a dynamic process on a graph where vertices change color from white to black if they have at least $k$ black neighbors. An irreversible $k$-conversion set of a graph $G$
Jan Kynčl +2 more
doaj +1 more source
ON ZAGREB INDICES AND ECCENTRIC CONNECTIVITY INDEX OF CERTAIN THORN GRAPHS
, 2016 The first three Zagreb indices of a graph G denoted, M1(G),M2(G) and M3(G), are well known. Equally well known is the eccentricity connectivity index denoted, ξ(G).
U. Mary +4 more
semanticscholar +1 more source
Finite-dimensional Zinbiel algebras and combinatorial structures
Analele Stiintifice ale Universitatii Ovidius Constanta: Seria Matematica, 2022 In this paper, we study the link between finite-dimensional Zinbiel algebras and combinatorial structures or (pseudo)digraphs determining which configurations are associated with those algebras.
Ceballos Manuel +2 more
doaj +1 more source