Undirected strict gammoids
V. Bryant (1984)
Fundamenta Mathematicae
Similarity:
V. Bryant (1984)
Fundamenta Mathematicae
Similarity:
Ardila, Federico (2007)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Ján Černý (1976)
Aplikace matematiky
Similarity:
Çevik, A.Sinan, Cangül, İ.Naci (2009)
General Mathematics
Similarity:
Gábor Mészáros (2016)
Discussiones Mathematicae Graph Theory
Similarity:
We study the inheritance of path-pairability in the Cartesian product of graphs and prove additive and multiplicative inheritance patterns of path-pairability, depending on the number of vertices in the Cartesian product. We present path-pairable graph families that improve the known upper bound on the minimal maximum degree of a path-pairable graph. Further results and open questions about path-pairability are also presented.
Manoj Changat, Henry Martyn Mulder (2001)
Mathematica Bohemica
Similarity:
The well known types of routes in graphs and directed graphs, such as walks, trails, paths, and induced paths, are characterized using axioms on vertex sequences. Thus non-graphic characterizations of the various types of routes are obtained.
Christian Commault, Jean-Michel Dion, Jacob W. van der Woude (2002)
Kybernetika
Similarity:
In this paper we investigate some of the computational aspects of generic properties of linear structured systems. In such systems only the zero/nonzero pattern of the system matrices is assumed to be known. For structured systems a number of characterizations of so-called generic properties have been obtained in the literature. The characterizations often have been presented by means of the graph associated to a linear structured system and are then expressed in terms of the maximal...