Primitive non-powerful symmetric loop-free signed digraphs with given base and minimum number of arcs

DOI10.1016/j.laa.2010.11.003zbMath1204.05051OpenAlexW2002115327MaRDI QIDQ624523

Yuhan Wu, Lihua You

Publication date: 9 February 2011

Published in: Linear Algebra and its Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.laa.2010.11.003

zbMATH Keywords

basesymmetricprimitivesigned digraphnon-powerful

Mathematics Subject Classification ID

Theory of matrix inversion and generalized inverses (15A09) Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Positive matrices and their generalizations; cones of matrices (15B48) Directed graphs (digraphs), tournaments (05C20) Signed and weighted graphs (05C22)

Related Items (1)

A survey on bases of sign pattern matrices

Cites Work

• Unnamed Item
• Unnamed Item
• Primitive graphs with given exponents and minimum number of edges
• Primitive zero-symmetric sign pattern matrices with the maximum base
• Irreducible sign \(k\)-potent sign pattern matrices
• On the period and base of a sign pattern matrix
• The exponent set of symmetric primitive (0,1) matrices with zero trace
• Bounds on the bases of irreducible generalized sign pattern matrices
• The base sets of primitive zero-symmetric sign pattern matrices
• On exponents of primitive matrices
• Nonnegative primitive matrices with exponent 2

This page was built for publication: Primitive non-powerful symmetric loop-free signed digraphs with given base and minimum number of arcs