Results 11 to 20 of about 1,168 (127)
Relative timing information and orthology in evolutionary scenarios [PDF]
Algorithms for Molecular Biology, 2023 Background Evolutionary scenarios describing the evolution of a family of genes within a collection of species comprise the mapping of the vertices of a gene tree T to vertices and edges of a species tree S.
David Schaller +5 more
doaj +2 more sources
Orthology and near-cographs in the context of phylogenetic networks [PDF]
Algorithms for Molecular BiologyOrthologous genes, which arise through speciation, play a key role in comparative genomics and functional inference. In particular, graph-based methods allow for the inference of orthology estimates without prior knowledge of the underlying gene or ...
Anna Lindeberg +3 more
doaj +2 more sources
Enumerating conjugacy classes of graphical groups over finite fields
Bulletin of the London Mathematical Society, Volume 54, Issue 5, Page 1923-1943, October 2022., 2022 Abstract Each graph and choice of a commutative ring gives rise to an associated graphical group. In this article, we introduce and investigate graph polynomials that enumerate conjugacy classes of graphical groups over finite fields according to their sizes.
Tobias Rossmann
wiley +1 more source
Mathematical Problems in Engineering, Volume 2022, Issue 1, 2022., 2022 In social network, users can manage their social network and social identity, publish information on various topics, and obtain information published by other users through friend relationship. The resulting large amount of text data attract more and more scholars to study it.
A. Yana, Ning Cao
wiley +1 more source
Graphon convergence of random cographs
Random Structures &Algorithms, Volume 59, Issue 3, Page 464-491, October 2021., 2021 Abstract We study the behavior of random labeled and unlabeled cographs with n vertices as n tends to infinity. We show that both models admit a novel random graphon W1/2 as distributional limit. Our main tool is an enhanced skeleton decomposition of the random Pólya tree with n leaves and no internal vertices having only one child.
Benedikt Stufler
wiley +1 more source
Sum structures in abelian groups
Examples and Counterexamples, 2023 Any set S of elements from an abelian group produces a graph with colored edges G(S), with its points the elements of S, and the edge between points P and Q assigned for its “color” the sum P+Q.
Robert Haas
doaj +1 more source
Intersection Cographs and Aesthetics
Journal of Humanistic Mathematics, 2022 Summary: Cographs are complete graphs with colored lines (edges); in an intersection cograph, the points (vertices) and lines (edges) are labeled by sets, and the line between each pair of points is (or represents) their intersection. This article first presents the elementary theory of intersection cographs: 15 are possible on 4 points; constraints on
openaire +2 more sources
Families of Integral Cographs within a Triangular Array
Special Matrices, 2020 The determinant Hosoya triangle, is a triangular array where the entries are the determinants of two-by-two Fibonacci matrices. The determinant Hosoya triangle mod 2 gives rise to three infinite families of graphs, that are formed by complete product ...
Ching Hsin-Yun +2 more
doaj +1 more source
Graphs and Combinatorics, 2023 A graph that can be generated from $K_1$ using joins and 0-sums is called a cograph. We define a sesquicograph to be a graph that can be generated from $K_1$ using joins, 0-sums, and 1-sums. We show that, like cographs, sesquicographs are closed under induced minors.
openaire +3 more sources
A note on the convexity number for complementary prisms [PDF]
Discrete Mathematics & Theoretical Computer Science, 2019 In the geodetic convexity, a set of vertices $S$ of a graph $G$ is $\textit{convex}$ if all vertices belonging to any shortest path between two vertices of $S$ lie in $S$. The cardinality $con(G)$ of a maximum proper convex set $S$ of $G$ is the $\textit{
Diane Castonguay +3 more
doaj +1 more source