💡 Words with a Similar Meaning to "Comdag"
Found via reverse dictionary — words that share a conceptual meaning.
| Word | Definition |
|---|---|
| dicyclenoun | A vehicle with two wheels side by side. |
| acyclic digraphnoun | (graph theory, computer science) A directed acyclic graph, a finite directed graph that contains no directed cycles. |
| digraphnoun | (linguistics) A pair of letters, especially a pair representing a single phoneme. |
| directed acyclic graphnoun | (graph theory, computer science) A finite directed graph that contains no directed cycles. |
| cographnoun | (mathematics) A graph formed from another by complementation and disjoin union. |
| dipathnoun | (graph theory) directed path |
| digonnoun | (geometry) A polygon having two edges and two vertices. |
| multidigraphnoun | (graph theory) A directed graph that is permitted to have multiple arcs connecting the same source and target nodes. |
| cocliquenoun | (graph theory) a subgraph whose complement is a clique, i.e. an independent set |
| cocktail party graphnoun | (mathematics) A graph consisting of two rows of paired nodes in which all nodes except the paired ones are connected with straight lines; it is the complement of the ladder rung graph, and the dual graph of the hypercube. |
| coarraynoun | (computing) A variable declared with a codimension. |
| cogroupnoun | (mathematics) The dual of a group. |
| tournamentnoun | A series of games; either the same game played many times, or a succession of games related by a single theme; played competitively to determine a single winning team or individual. |
| polygraphnoun | A device which measures and records several physiological variables such as blood pressure, heart rate, respiration and skin conductivity while a series of questions is being posed to a subject, in an attempt to detect deception. |
| anticyclenoun | (graph theory) A cycle in the complement of a given graph. |
| coactionnoun | Collective or collaborative action. |
| pseudodigraphnoun | (graph theory) A graph that resembles a directed graph but violates one of the normal rules, as for example by including a directed loop. |
| directed graphnoun | (graph theory) A graph in which the edges are ordered pairs, so that, if the edge (a, b) is in the graph, the edge (b, a) need not be in the graph and is distinct from (a, b) if it is. |
| cotreenoun | (mathematics) A tree that defines a cograph, its leaves corresponding to the nodes of the cograph. |
| free categorynoun | (category theory) A category that is induced by a multidigraph thus: it has as its objects the vertices of the multidigraph and its morphisms are paths in the multidigraph; composition of morphisms is concatenation of paths, as long as the end of one path coincides with the beginning of the other path; an identity morphism of an object is an “empty path” at that vertex. |
Translate “Comdag” into Another Language
Pick a language — the word will be pre-filled in the translator.