✦ LIBER ✦

A note on the graph’s resolvent and the multifilar structure

✍ Scribed by Vladimir Ejov; Shmuel Friedland; Giang T. Nguyen

Publisher: Elsevier Science
Year: 2009
Tongue: English
Weight: 367 KB
Volume: 431
Category: Article
ISSN: 0024-3795
DOI: 10.1016/j.laa.2009.05.019

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Erratum to “A note on the graph’s resolv

Erratum to “A note on the graph’s resolvent and the multifilar structure”

✍ Vladimir Ejov; Shmuel Friedland; Giang T. Nguyen 📂 Article 📅 2010 🏛 Elsevier Science 🌐 English ⚖ 48 KB

A note on the resolvent of a nonnegative

A note on the resolvent of a nonnegative matrix and its applications

✍ Siddhartha Sahi 📂 Article 📅 2010 🏛 Elsevier Science 🌐 English ⚖ 102 KB

A note on the combinatorial structure of

A note on the combinatorial structure of the visibility graph in simple polygons

✍ L. Prasad; S.S. Iyengar 📂 Article 📅 1995 🏛 Elsevier Science 🌐 English ⚖ 954 KB

A note on the exceptional graph of the c

A note on the exceptional graph of the cubic lattice graph characterization

✍ Curtis R Cook 📂 Article 📅 1973 🏛 Elsevier Science 🌐 English ⚖ 253 KB

On an upper bound of a graph's chromatic

On an upper bound of a graph's chromatic number, depending on the graph's degree and density

✍ O.V Borodin; A.V Kostochka 📂 Article 📅 1977 🏛 Elsevier Science 🌐 English ⚖ 159 KB

A note on the bottleneck graph partition

A note on the bottleneck graph partition problem

✍ Klinz, Bettina; Woeginger, Gerhard J. 📂 Article 📅 1999 🏛 John Wiley and Sons 🌐 English ⚖ 47 KB 👁 2 views

The bottleneck graph partition problem consists of partitioning the vertices of an undirected edge-weighted graph into two equally sized sets such that the maximum edge weight in the cut separating the two sets becomes minimum. In this short note, we present an optimum algorithm for this problem wit