There are many digraph operators (or digraph valued functions) with which one can construct a new digraph from a given digraph, such as the line digraph, the total digraph, and their generalizations. One such a digraph operator is called a directed pathos line digraph of an arborescence
An arborescence in a digraph is a tree directed away from its root. A classical theorem of Edmonds c...
AbstractThe underlying graph G(D) of a digraph D is arising when directions of edges are ignored.Chv...
AbstractWe characterize digraphs without any path of length two or of length three
A directed pathos middle digraph of an arborescence Aᵣ, written Q = DPM(Aᵣ), is the digraph whose ve...
The path number of a graph G is the number of paths in any pathos. The path number of a tree T equal...
AbstractThe line-digraph of a digraph D with vertices V1, …, Vn is the digraph D∗ obtained from D by...
In this note, we extend the characterization of paths to directed paths, which is needed to characte...
The concept of a line signed digraph is generalized to that of a path signed digraphs
The concept of pathos of a graph G was introduced by Harary [2], as a collection of minimum number o...
AbstractTwo combinatorial structures which describe the branchings in a graph are graphic matroids a...
An arborescence in a digraph is a tree directed away from its root.A classical theorem of Edmonds c...
A characterization is given for acyclic digraphs that are the acyclic intersection digraphs of subpa...
In this communication, the concept of pathos line graph is introduced. Its study is concentrated onl...
In previous papers, the author defined a notion of admissible functions on digraphs, studied its pro...
The concept of a line digraph is generalized to that of a directed path graph. The directed path gra...
An arborescence in a digraph is a tree directed away from its root. A classical theorem of Edmonds c...
AbstractThe underlying graph G(D) of a digraph D is arising when directions of edges are ignored.Chv...
AbstractWe characterize digraphs without any path of length two or of length three
A directed pathos middle digraph of an arborescence Aᵣ, written Q = DPM(Aᵣ), is the digraph whose ve...
The path number of a graph G is the number of paths in any pathos. The path number of a tree T equal...
AbstractThe line-digraph of a digraph D with vertices V1, …, Vn is the digraph D∗ obtained from D by...
In this note, we extend the characterization of paths to directed paths, which is needed to characte...
The concept of a line signed digraph is generalized to that of a path signed digraphs
The concept of pathos of a graph G was introduced by Harary [2], as a collection of minimum number o...
AbstractTwo combinatorial structures which describe the branchings in a graph are graphic matroids a...
An arborescence in a digraph is a tree directed away from its root.A classical theorem of Edmonds c...
A characterization is given for acyclic digraphs that are the acyclic intersection digraphs of subpa...
In this communication, the concept of pathos line graph is introduced. Its study is concentrated onl...
In previous papers, the author defined a notion of admissible functions on digraphs, studied its pro...
The concept of a line digraph is generalized to that of a directed path graph. The directed path gra...
An arborescence in a digraph is a tree directed away from its root. A classical theorem of Edmonds c...
AbstractThe underlying graph G(D) of a digraph D is arising when directions of edges are ignored.Chv...
AbstractWe characterize digraphs without any path of length two or of length three
DOI
Add to ORKG