Results 21 to 30 of about 1,967 (126)
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
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
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
Coherent Interaction Graphs [PDF]
Electronic Proceedings in Theoretical Computer Science, 2019 We introduce the notion of coherent graphs, and show how those can be used to define dynamic semantics for Multiplicative Linear Logic (MLL) extended with non-determinism.
Lê Thành Dũng Nguyen, Thomas Seiller
doaj +1 more source
A Diagonalization Algorithm for the Distance Matrix of Cographs
IEEE Access, 2018 Cographs is a well-known class of graphs in graph theory, which can be generated from a single vertex by applying a series of complement (or equivalently join operations) and disjoint union operations.
Zhibin Du
doaj +1 more source
Partial Homology Relations - Satisfiability in terms of Di-Cographs [PDF]
, 2018 Directed cographs (di-cographs) play a crucial role in the reconstruction of evolutionary histories of genes based on homology relations which are binary relations between genes.
A Brandstädt +32 more
core +2 more sources
Recognition of chordal graphs and cographs which are Cover-Incomparability graphs [PDF]
Discrete Mathematics & Theoretical Computer ScienceCover-Incomparability graphs (C-I graphs) are an interesting class of graphs from posets. A C-I graph is a graph from a poset $P=(V,\le)$ with vertex set $V$, and the edge-set is the union of edge sets of the cover graph and the incomparability graph of ...
Arun Anil, Manoj Changat
doaj +1 more source
Secure total domination in chain graphs and cographs
AKCE International Journal of Graphs and Combinatorics, 2020 Let G = (V,E) be a graph without isolated vertices. A subset D of vertices of G is called a total dominating set of G if for every there exists a vertex such that A total dominating set D of a graph G is called a secure total dominating set of G if for ...
Anupriya Jha
doaj +1 more source
Parameterized Complexity of Equitable Coloring [PDF]
Discrete Mathematics & Theoretical Computer Science, 2019 A graph on $n$ vertices is equitably $k$-colorable if it is $k$-colorable and every color is used either $\left\lfloor n/k \right\rfloor$ or $\left\lceil n/k \right\rceil$ times.
Guilherme de C. M. Gomes +2 more
doaj +1 more source