On the -basis of a digraph
Matúš Harminc (1980)
Mathematica Slovaca
Similarity:
Displaying similar documents to “On functions which sum to zero on semicycles”
On the -basis of a digraph
Which directed graphs have a solution?
Mehdi Behzad, Frank Harary (1977)
Mathematica Slovaca
Similarity:
Some Remarks On The Structure Of Strong K-Transitive Digraphs
César Hernández-Cruz, Juan José Montellano-Ballesteros (2014)
Discussiones Mathematicae Graph Theory
Similarity:
A digraph D is k-transitive if the existence of a directed path (v0, v1, . . . , vk), of length k implies that (v0, vk) ∈ A(D). Clearly, a 2-transitive digraph is a transitive digraph in the usual sense. Transitive digraphs have been characterized as compositions of complete digraphs on an acyclic transitive digraph. Also, strong 3 and 4-transitive digraphs have been characterized. In this work we analyze the structure of strong k-transitive digraphs having a cycle of length at least...
An Algorithm for Scaling Matrices and Computing the Minimum Cycle Mean in a Digraph.
M. von Golitschek (1980)
Numerische Mathematik
Similarity:
Circuit bases of strongly connected digraphs
Petra M. Gleiss, Josef Leydold, Peter F. Stadler (2003)
Discussiones Mathematicae Graph Theory
Similarity:
The cycle space of a strongly connected graph has a basis consisting of directed circuits. The concept of relevant circuits is introduced as a generalization of the relevant cycles in undirected graphs. A polynomial time algorithm for the computation of a minimum weight directed circuit basis is outlined.
A note on removing a point of a strong digraph
Peter Horák (1983)
Mathematica Slovaca
Similarity:
Union of all the minimum cycle bases of a graph.
Vismara, Philippe (1997)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
On Hallian digraphs and their binding number
Mieczysław Borowiecki, Danuta Michalak (1989)
Banach Center Publications
Similarity: