✦ LIBER ✦

Reinforcement numbers of digraphs

✍ Scribed by Jia Huang; Jian-Wei Wang; Jun-Ming Xu

Book ID: 108112799
Publisher: Elsevier Science
Year: 2009
Tongue: English
Weight: 580 KB
Volume: 157
Category: Article
ISSN: 0166-218X
DOI: 10.1016/j.dam.2009.01.002

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

The hamiltonian numbers in digraphs

✍ Ting-Pang Chang, Li-Da Tong 📂 Article 📅 2012 🏛 Springer US 🌐 English ⚖ 343 KB

Feedback numbers of de Bruijn digraphs

✍ Xirong Xu; Yongchang Cao; Jun-Ming Xu; Yezhou Wu 📂 Article 📅 2010 🏛 Elsevier Science 🌐 English ⚖ 586 KB

A subset of vertices of a graph G is called a feedback vertex set of G if its removal results in an acyclic subgraph. Let f (d, n) denote the minimum cardinality over all feedback vertex sets of the de Bruijn digraph B (d, n). This paper proves that for any integers d ≥ 2 and n ≥ 2 where i | n mean

Path number of bipartite digraphs

✍ William G Frye; Renu Laskar 📂 Article 📅 1980 🏛 Elsevier Science 🌐 English ⚖ 112 KB

The number of functional digraphs

✍ Frank Harary 📂 Article 📅 1959 🏛 Springer 🌐 English ⚖ 536 KB

The Number of Strong Digraphs

✍ Wright, E. M. 📂 Article 📅 1971 🏛 Oxford University Press 🌐 English ⚖ 417 KB

The geodetic numbers of graphs and digra

The geodetic numbers of graphs and digraphs

✍ Chang-hong Lu 📂 Article 📅 2007 🏛 SP Science China Press 🌐 English ⚖ 320 KB