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

DOI10.1016/J.LAA.2010.11.003zbMATH Open1204.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

primitivesymmetricbasesigned digraphnon-powerful

Mathematics Subject Classification ID

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

Cites Work

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

Cited In (4)

• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• A survey on bases of sign pattern matrices

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)