digraph


Also found in: Dictionary, Thesaurus, Wikipedia.

digraph

[′dī‚graf]
(mathematics)
directed graph
McGraw-Hill Dictionary of Scientific & Technical Terms, 6E, Copyright © 2003 by The McGraw-Hill Companies, Inc.
The following article is from The Great Soviet Encyclopedia (1979). It might be outdated or ideologically biased.

Digraph

 

a combination of two or more letters that indicate a single sound, for example, Polish sz and cz. In Russian known as ligatura, see LIGATURE.

The Great Soviet Encyclopedia, 3rd Edition (1970-1979). © 2010 The Gale Group, Inc. All rights reserved.

digraph

In some programming languages, a digraph is two common keyboard characters used together that represent one symbol. For example, (* and *) have represented the curly braces { and }. A trigraph uses three characters such as ??- for a tilde ~. Digraphs and trigraphs are methods for ensuring symbols can be entered into source code from an abbreviated keyboard that has fewer keys than a full-size unit.
Copyright © 1981-2019 by The Computer Language Company Inc. All Rights reserved. THIS DEFINITION IS FOR PERSONAL USE ONLY. All other reproduction is strictly prohibited without permission from the publisher.
Mentioned in ?
References in periodicals archive ?
in [2], Choi constructs a bijection between the set of Davis-Januszkiewicz equivalence classes of small covers over an n-cube and the set of acyclic digraphs with n-labeled nodes.
The number of orientable small covers over a product of simplices
Example 7 Consider the SVN digraph [mathematical expression not reproducible] in Figure 1 with vertex set [mathematical expression not reproducible] and arc set [mathematical expression not reproducible] with one loop at each vertex as follows:
On Single Valued Neutrosophic Signed Digraph and its Applications
Let digraph (G, A) be strongly connected, in which A = [([[delta].sub.kh]).sub.lxl].
Graph-Theoretic Approach to Exponential Stability of Delayed Coupled Systems on Networks under Periodically Intermittent Control
(ii) The digraph G = (V, E) is said to be transitive if whenever (x, y) [member of] E and (y, z) [member of] E, (x, z) [member of] E.
Extension of Kirk-Saliga Fixed Point Theorem in a Metric Space with a Reflexive Digraph
Jia, "Interval bipartite consensus of networked agents associated with signed digraphs," Institute of Electrical and Electronics Engineers Transactions on Automatic Control, vol.
Event-Triggered Bipartite Consensus of Single-Integrator Multi-Agent Systems with Measurement Noise
where each [G.sub.i] is a digraph. We need this fact and the following lemmas.
The Structure of Isomorphic Digraph from Powers Modulo [p.sup.e]
In Section 4, the existence of a common N-tupled fixed point of operators satisfying ([phi], [psi])-contractive conditions in metric spaces endowed with a digraph is considered.
Some Results on N-Tupled Coincidence and Fixed Points of Graphs on Metric Spaces and an Application to Integral Equations
By induction, there exists digraph isomorphism [[phi].sub.i] : T([a.sub.i]) [right arrow] T([b.sub.i]).
Dynamics of Endomorphism of Finite Abelian Groups
The adjancency matrixA(D) of a digraph D is the p x p matrix [[a.sub.ij]] with [a.sub.ij] = 1 if [v.sub.i][v.sub.j] is an arc of D, and 0 otherwise (Fig.
Application of Graph Theory in Automation
Based on the two sets, we can construct strong/weak dominant digraph. The procedure by which we sequence the alternatives by using the two digraphs seems like that stated in Step 2 of the ELECTRE-II method.
A Decision Model for Emergency Warehouse Location Based on a Novel Stochastic MCDA Method: Evidence from China
If the digraph G has a spanning tree, then its Laplacian matrix L has a simple zero eigenvalue and all other eigenvalues have positive real parts.
Consensus of High-Order Nonlinear Multiagent Systems with Constrained Switching Topologies

Encyclopedia browser ?
Full browser ?