The \(k\)th upper bases of primitive non-powerful signed digraphs

DOI10.1016/J.DISC.2008.06.039zbMATH Open1207.05073arXiv0907.1122OpenAlexW2088998335MaRDI QIDQ1043614

Yubin Gao, Yanling Shao, J. Shen

Publication date: 9 December 2009

Published in: Discrete Mathematics (Search for Journal in Brave)

Abstract: In this paper, we study the kth upper bases of primitive non-powerful signed digraphs. A bound on the kth upper bases of all primitive non-powerful signed digraphs is obtained, and the equality case of the bound is characterized. We also show that there exists "gap" in the kth upper base set of primitive non-powerful signed digraphs.

Full work available at URL: https://arxiv.org/abs/0907.1122

zbMATH Keywords

sign patterndigraphprimitive digraphbase

Mathematics Subject Classification ID

Directed graphs (digraphs), tournaments (05C20) Signed and weighted graphs (05C22)

Cites Work

• Bounds on the base of primitive nearly reducible sign pattern matrices
• Note on Linear Forms
• On the period and base of a sign pattern matrix
• Bounds on the bases of irreducible generalized sign pattern matrices
• Generalized exponents of primitive directed graphs
• Irreducible sign \(k\)-potent sign pattern matrices
• On a conjecture about the generalized exponent of primitive matrices
• The \(k\)th upper multiexponents of primitive matrices

Cited In (4)

• Thekth upper and lower bases of primitive nonpowerful minimally strong signed digraphs
• The \(k\)th lower bases of primitive non-powerful signed digraphs
• The generalized \(\tau \)-bases of primitive non-powerful signed digraphs with \(d\) loops
• A survey on bases of sign pattern matrices

This page was built for publication: The \(k\)th upper bases of primitive non-powerful signed digraphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1043614)