Primitive non-powerful symmetric loop-free signed digraphs with given base and minimum number of arcs
From MaRDI portal
(Redirected from Publication:624523)
Recommendations
- Primitive non-powerful symmetric loop-free signed digraphs with base 3 and minimum number of arcs
- The \(k\)th upper and lower bases of primitive nonpowerful minimally strong signed digraphs
- An upper bound on the base of a special class of primitive nonpowerful symmetric signed digraphs
- scientific article; zbMATH DE number 5850554
- The bases of primitive non-powerful complete signed graphs
Cites work
- Bounds on the bases of irreducible generalized sign pattern matrices
- Combinatorial matrix theory
- Graph theory
- Irreducible sign k-potent sign pattern matrices
- Nonnegative primitive matrices with exponent 2
- On exponents of primitive matrices
- On the period and base of a sign pattern matrix
- Primitive graphs with given exponents and minimum number of edges
- Primitive zero-symmetric sign pattern matrices with the maximum base
- The base sets of primitive zero-symmetric sign pattern matrices
- The exponent set of symmetric primitive (0,1) matrices with zero trace
Cited in
(5)- A survey on bases of sign pattern matrices
- Primitive non-powerful symmetric loop-free signed digraphs with base 3 and minimum number of arcs
- scientific article; zbMATH DE number 5850554 (Why is no real title available?)
- scientific article; zbMATH DE number 6129936 (Why is no real title available?)
- scientific article; zbMATH DE number 6263584 (Why is no real title available?)
This page was built for publication: Primitive non-powerful symmetric loop-free signed digraphs with given base and minimum number of arcs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q624523)