Strongly connected multivariate digraphs
From MaRDI portal
Publication:521369
zbMath1358.05128MaRDI QIDQ521369
Zeying Xu, Yinfeng Zhu, Yaokun Wu
Publication date: 10 April 2017
Published in: The Electronic Journal of Combinatorics (Search for Journal in Brave)
Full work available at URL: http://www.combinatorics.org/ojs/index.php/eljc/article/view/v24i1p47
hydradiameterphase spaceMarkov operatorperiodcyclic decompositionde Bruijn formprimitive exponenttensor multiplication
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Positive dynamical systems in discrete time. Theory, models and applications
- On the complexity of strongly connected components in directed hypergraphs
- On the discovery of the cycle-axiom of hypergraphs
- Wielandt's proof of the exponent inequality for primitive nonnegative matrices
- Hoffman polynomials of nonnegative irreducible matrices and strongly connected digraphs
- Max algebraic powers of irreducible matrices in the periodic regime: an application of cyclic classes
- Lifespan in a primitive Boolean linear dynamical system
- Perron-Frobenius theorem for nonnegative tensors
- Markov chains and tensor multiplications
- Distances in orientations of graphs
- Directed hypergraphs and applications
- Primitive tensors and directed hypergraphs
- Further results and some open problems on the primitive degree of nonnegative tensors
- Diameter of orientations of graphs with given minimum degree
- A general product of tensors with applications
- A conjecture on the primitive degree of tensors
- De Bruijn digraphs and affine transformations
- An Expansion Property of Boolean Linear Maps
- Tensors and Their Eigenvectors
- Primitivity, the Convergence of the NQZ Method, and the Largest Eigenvalue for Nonnegative Tensors
- Algebraic Potential Theory on Graphs
- Tensor compositions and lists of combinatorial structures
- An Introduction to Symbolic Dynamics and Coding
- Basic Category Theory
- Digraphs
- Integer Programming and Combinatorial Optimization
- A Theorem on Graphs, with an Application to a Problem of Traffic Control
- Normal Recurring Decimals
- General Theory of Natural Equivalences