✦ LIBER ✦

Computing the vertex separation of unicyclic graphs

✍ Scribed by John Ellis; Minko Markov

Book ID: 113641519
Publisher: Elsevier Science
Year: 2004
Tongue: English
Weight: 738 KB
Volume: 192
Category: Article
ISSN: 0890-5401
DOI: 10.1016/j.ic.2004.03.005

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Computer generation of vertex graphs

✍ N.S. Sridharan 📂 Article 📅 1974 🏛 Elsevier Science 🌐 English ⚖ 870 KB

Partitioning Hypergraphs in Scientific C

Partitioning Hypergraphs in Scientific Computing Applications through Vertex Separators on Graphs

✍ Kayaaslan, Enver; Pinar, Ali; Çatalyürek, Ümit; Aykanat, Cevdet 📂 Article 📅 2012 🏛 Society for Industrial and Applied Mathematics 🌐 English ⚖ 451 KB

The Estrada index of unicyclic graphs

✍ Zhibin Du; Bo Zhou 📂 Article 📅 2012 🏛 Elsevier Science 🌐 English ⚖ 295 KB

The Laplacian spread of unicyclic graphs

✍ Yan-Hong Bao; Ying-Ying Tan; Yi-Zheng Fan 📂 Article 📅 2009 🏛 Elsevier Science 🌐 English ⚖ 477 KB

On the nullity of unicyclic graphs

✍ Tan Xuezhong; Bolian Liu 📂 Article 📅 2005 🏛 Elsevier Science 🌐 English ⚖ 271 KB

The Separator Theorem for Rooted Directe

The Separator Theorem for Rooted Directed Vertex Graphs

✍ B.S. Panda 📂 Article 📅 2001 🏛 Elsevier Science 🌐 English ⚖ 109 KB

In this note we point out a flaw in the separator theorem for rooted directed vertex graphs due to C. L. Monma and V. K. Wei (1986, J. Combin. Theory Ser. B 41, 141 181), and present a modified separator theorem for the same class of graphs.