✦ LIBER ✦

Characterization of signed line digraphs

✍ Scribed by Acharya, Mukti; Sinha, Deepa

Book ID: 122743388
Publisher: Elsevier Science
Year: 2013
Tongue: English
Weight: 181 KB
Volume: 161
Category: Article
ISSN: 0166-218X
DOI: 10.1016/j.dam.2012.10.005

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Energy of signed digraphs

✍ Pirzada, S.; Bhat, Mushtaq A. 📂 Article 📅 2014 🏛 Elsevier Science 🌐 English ⚖ 458 KB

Signed total (k,k)-domatic number of dig

Signed total (k,k)-domatic number of digraphs

✍ S. M. Sheikholeslami; L. Volkmann 📂 Article 📅 2011 🏛 Springer 🌐 English ⚖ 196 KB

The kth lower bases of primitive non-pow

The kth lower bases of primitive non-powerful signed digraphs

✍ Chaohua Liang; Bolian Liu; Yufei Huang 📂 Article 📅 2010 🏛 Elsevier Science 🌐 English ⚖ 181 KB

The th upper bases of primitive non-powe

The th upper bases of primitive non-powerful signed digraphs

✍ Yanling Shao; Jian Shen; Yubin Gao 📂 Article 📅 2009 🏛 Elsevier Science 🌐 English ⚖ 482 KB

The forbidden minor characterization of

The forbidden minor characterization of line-search antimatroids of rooted digraphs

✍ Yoshio Okamoto; Masataka Nakamura 📂 Article 📅 2003 🏛 Elsevier Science 🌐 English ⚖ 303 KB

An antimatroid is an accessible union-closed family of subsets of a ÿnite set. A number of classes of antimatroids are closed under taking minors such as point-search antimatroids of rooted (di)graphs, line-search antimatroids of rooted (di)graphs, shelling antimatroids of rooted trees, shelling ant

A line digraph of a complete bipartite d

A line digraph of a complete bipartite digraph

✍ Juan Liu; Lin Sun; Jixiang Meng 📂 Article 📅 2009 🏛 Elsevier Science 🌐 English ⚖ 310 KB

In the context of the degree/diameter problem for directed graphs, it is known that the number of vertices of a strongly connected bipartite digraph satisfies a Moore-like bound in terms of its diameter k and the maximum outdegrees (d 1 , d 2 ) of its partite sets of vertices. In this work, we defi