Search engine for discovering works of Art, research articles, and books related to Art and Culture
Javascript must be enabled to continue!
Digraphs
View through CrossRef
This chapter gives the basic introduction to directed graphs (digraphs) and their pertinent concepts, elements, and frameworks. From a general point of view, the most majority of concepts of digraphs have similar characteristics with networks structures. Therefore, in conjunction with networks chapter, this chapter not only emphasizes some aspect of digraphs, but also addresses the basic terminology and terms that have been widely applied in literature. Regarding this premise, the first section presents the basic definitions, and the second section classifies the most important and applicable types of digraphs extensively addressed in the literature. Moreover, one of the main concepts of digraphs (reachability and connectivity) is discussed in the third section. In addition, the fourth section briefly discusses a few application cases of digraphs, and the fifth section finally presents the conclusion of this chapter.
Title: Digraphs
Description:
This chapter gives the basic introduction to directed graphs (digraphs) and their pertinent concepts, elements, and frameworks.
From a general point of view, the most majority of concepts of digraphs have similar characteristics with networks structures.
Therefore, in conjunction with networks chapter, this chapter not only emphasizes some aspect of digraphs, but also addresses the basic terminology and terms that have been widely applied in literature.
Regarding this premise, the first section presents the basic definitions, and the second section classifies the most important and applicable types of digraphs extensively addressed in the literature.
Moreover, one of the main concepts of digraphs (reachability and connectivity) is discussed in the third section.
In addition, the fourth section briefly discusses a few application cases of digraphs, and the fifth section finally presents the conclusion of this chapter.
Related Results
On isomorphisms of m-Cayley digraphs
On isomorphisms of m-Cayley digraphs
The isomorphism problem for digraphs is a fundamental problem in graph theory. This problem for Cayley digraphs has been extensively investigated over the last half a century. In t...
Sub-exponential Time Parameterized Algorithms for Graph Layout Problems on Digraphs with Bounded Independence Number
Sub-exponential Time Parameterized Algorithms for Graph Layout Problems on Digraphs with Bounded Independence Number
AbstractFradkin and Seymour (J Comb Theory Ser B 110:19–46, 2015) defined the class of digraphs of bounded independence number as a generalization of the class of tournaments. They...
Efficient Open Domination in Digraph Products
Efficient Open Domination in Digraph Products
A digraph D is an efficient open domination digraph if there exists a subset S of V ( D ) for which the open out-neighborhoods centered in the vertices of S form a partitio...
On link-irregular digraphs
On link-irregular digraphs
We extend the study of link-irregular graphs to directed graphs (digraphs), where a digraph is link-irregular if no two vertices have isomorphic directed links. We establish that l...
On the Aα spectral radius of generalized weighted digraphs
On the Aα spectral radius of generalized weighted digraphs
Let G = (V(G), E(G)) be a generalized weighted digraph without loops and multiple arcs, where the weight of each arc is a nonnegative and symmetric matrix of same order p. For vi ?...
Drawing compound digraphs and its application to an idea organizer (abstract)
Drawing compound digraphs and its application to an idea organizer (abstract)
An
upward
drawing of an acyclic digraph is a planar straight-line drawing with the additional requirement that all the edges flow in the same direction, e.g...
On the spectral radius of weighted digraphs
On the spectral radius of weighted digraphs
We consider the weighted digraphs in which the arc weights are positive definite matrices. We obtain some upper bounds for the spectral radius of these digraphs and characterize th...
Product of digraphs, (super) edge-magic valences and related problems
Product of digraphs, (super) edge-magic valences and related problems
Discrete Mathematics, and in particular Graph Theory, has gained a lot of popularity during the last 7 decades. Among the many branches in Graph Theory, graph labelings has experim...