Primitivity of generalized direct product of digraphs.
Petrić, Milenko (1996)
Publications de l'Institut Mathématique. Nouvelle Série
Similarity:
Petrić, Milenko (1996)
Publications de l'Institut Mathématique. Nouvelle Série
Similarity:
Peter Horák (1982)
Mathematica Slovaca
Similarity:
Matúš Harminc, Roman Soták (1999)
Discussiones Mathematicae Graph Theory
Similarity:
For given nonnegative integers k,s an upper bound on the minimum number of vertices of a strongly connected digraph with exactly k kernels and s solutions is presented.
Weige Xi, Ligong Wang (2016)
Discussiones Mathematicae Graph Theory
Similarity:
Let G = (V (G),E(G)) be a simple strongly connected digraph and q(G) be the signless Laplacian spectral radius of G. For any vertex vi ∈ V (G), let d+i denote the outdegree of vi, m+i denote the average 2-outdegree of vi, and N+i denote the set of out-neighbors of vi. In this paper, we prove that: (1) (1) q(G) = d+1 +d+2 , (d+1 ≠ d+2) if and only if G is a star digraph [...] ,where d+1, d+2 are the maximum and the second maximum outdegree, respectively [...] is the digraph on n vertices...
Mehdi Behzad, Frank Harary (1977)
Mathematica Slovaca
Similarity:
Bhargava, T.N., O'Korn, L.J. (1967)
Portugaliae mathematica
Similarity:
Mieczysław Borowiecki, Danuta Michalak (1989)
Banach Center Publications
Similarity: