✦ LIBER ✦

The kth lower bases of primitive non-powerful signed digraphs

✍ Scribed by Chaohua Liang; Bolian Liu; Yufei Huang

Publisher: Elsevier Science
Year: 2010
Tongue: English
Weight: 181 KB
Volume: 432
Category: Article
ISSN: 0024-3795
DOI: 10.1016/j.laa.2009.11.023

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Bounds on the local bases of primitive,

Bounds on the local bases of primitive, non-powerful, minimally strong signed digraphs

✍ Hongping Ma 📂 Article 📅 2009 🏛 Elsevier Science 🌐 English ⚖ 326 KB

The Generalizedτ-Bases of Primitive Non-

The Generalizedτ-Bases of Primitive Non-Powerful Signed Digraphs with d Loops

✍ Yufei Huang; Bolian Liu; Siyuan Chen 📂 Article 📅 2011 🏛 Springer Japan 🌐 English ⚖ 231 KB

Primitive non-powerful symmetric loop-fr

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

✍ Lihua You; Yuhan Wu 📂 Article 📅 2011 🏛 Elsevier Science 🌐 English ⚖ 272 KB

In [B.M. Kim, B.C. Song, W. Hwang, Primitive graphs with given exponents and minimum number of edges, Linear Algebra Appl. 420 (2007) 648-662], the minimum number of edges of a simple graph on n vertices with exponent k was determined. In this paper, we completely determine the minimum number, H(n,