✦ LIBER ✦

The skew energy of a digraph

✍ Scribed by C. Adiga; R. Balakrishnan; Wasin So

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

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

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

Lower bounds for the energy of digraphs

✍ Juan Rada 📂 Article 📅 2010 🏛 Elsevier Science 🌐 English ⚖ 236 KB

The McClelland inequality for the energy

The McClelland inequality for the energy of digraphs

✍ Juan Rada 📂 Article 📅 2009 🏛 Elsevier Science 🌐 English ⚖ 108 KB

On the skew energy of orientations of hy

On the skew energy of orientations of hypercubes

✍ Gui-Xian Tian 📂 Article 📅 2011 🏛 Elsevier Science 🌐 English ⚖ 563 KB

The dichromatic number of a digraph

✍ V Neumann-Lara 📂 Article 📅 1982 🏛 Elsevier Science 🌐 English ⚖ 321 KB

Connectivity of the Mycielskian of a dig

Connectivity of the Mycielskian of a digraph

✍ Litao Guo; Xiaofeng Guo 📂 Article 📅 2009 🏛 Elsevier Science 🌐 English ⚖ 383 KB