scientific article

From MaRDI portal
Publication:4041603

zbMath0291.05106MaRDI QIDQ4041603

Ján Plesník, Štefan Znám

Publication date: 1974


Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.



Related Items (35)

Hoffman polynomials of nonnegative irreducible matrices and strongly connected digraphsOn mixed almost Moore graphs of diameter twoExtraconnectivity of graphs with large minimum degree and girthMultipartite Moore digraphsDirected Moore hypergraphsUnnamed ItemOn mixed Moore graphsOn the super‐restricted arc‐connectivity of s ‐geodetic digraphsOn the order and size of \(s\)-geodetic digraphs with given connectivityOn the restricted arc-connectivity of \(s\)-geodetic digraphsOn the extraconnectivity of graphsOn mixed radial Moore graphs of diameter 3Non existence of some mixed Moore graphs of diameter 2 using SATUnnamed ItemOn digraphs of excess oneNonexistence of almost Moore digraphs of degrees 4 and 5 with self-repeatsOn the nonexistence of almost Moore digraphsOn the non-existence of families of \((d,k, \delta)\)-digraphs containing only selfrepeat verticesProperties of mixed Moore graphs of directed degree oneEnumerations of vertex orders of almost Moore digraphs with selfrepeatsHSAGA and its application for the construction of near-Moore digraphsAn inequality relating the order, maximum degree, diameter and connectivity of a strongly connected digraphThe underlying line digraph structure of some (0, 1)-matrix equationsMoore bound for mixed networksA family of mixed graphs with large order and diameter 2On total regularity of mixed graphs with order close to the Moore boundOn the nonexistence of almost Moore digraphs of degree four and fiveVertex-symmetric digraphs with small diameterA note on Moore Cayley digraphsOn large vertex-symmetric digraphsOn the existence of \((d,k)\)-digraphsExtraconnectivity of \(s\)-geodetic digraphs and graphsSubdigraphs of almost Moore digraphs induced by fixpoints of an automorphismAn extremal problem in geodetic graphsExtraconnectivity of graphs with large girth




This page was built for publication: