Connection digraphs and second-order line digraphs
نویسندگان
چکیده
منابع مشابه
Block Line Cut Vertex Digraphs of Digraphs
In this paper, the digraph valued function(digraph operator), namely the block line cut vertex digraph BLC(D) of a digraph D is defined, and the problem of reconstructing a digraph from its block line cut vertex digraph is presented. Outer planarity, maximal outer planarity, and minimally non-outer planarity properties of these digraphs are discussed.
متن کاملFrom expanded digraphs to lifts of voltage digraphs and line digraphs∗
In this note we present a general approach to construct large digraphs from small ones. These are called expanded digraphs, and, as particular cases, we show the close relationship between lifted digraphs of voltage digraphs and line digraphs, which are two known ways to obtain dense digraphs. In the same context, we show the equivalence between the vertex-splitting and partial line digraph tec...
متن کاملEdge-connection of graphs, digraphs, and hypergraphs
In this work extensions and variations of the notion of edge-connectivity of undirected graphs, directed graphs, and hypergraphs will be considered. We show how classical results concerning orientations and connectivity augmentations may be formulated in this more general setting.
متن کاملMore skew-equienergetic digraphs
Two digraphs of same order are said to be skew-equienergetic if their skew energies are equal. One of the open problems proposed by Li and Lian was to construct non-cospectral skew-equienergetic digraphs on n vertices. Recently this problem was solved by Ramane et al. In this paper, we give some new methods to construct new skew-equienergetic digraphs.
متن کاملA Note on the Order of Iterated Line Digraphs
Given a digraph G, we propose a new method to find the recurrence equation for the number of vertices nk of the k-iterated line digraph L (G), for k ≥ 0, where L(G) = G. We obtain this result by using the minimal polynomial of a quotient digraph π(G) of G. We show some examples of this method applied to the so-called cyclic Kautz, the unicyclic, and the acyclic digraphs. In the first case, our ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Mathematics
سال: 1982
ISSN: 0012-365X
DOI: 10.1016/0012-365x(82)90147-9