𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Localization on Quantum Graphs with Random Vertex Couplings

✍ Scribed by Frédéric Klopp; Konstantin Pankrashkin

Publisher
Springer
Year
2008
Tongue
English
Weight
517 KB
Volume
131
Category
Article
ISSN
0022-4715

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

One-factor in random graphs based on ver
One-factor in random graphs based on vertex choice
✍ E. Shamir; E. Upfal 📂 Article 📅 1982 🏛 Elsevier Science 🌐 English ⚖ 541 KB

The following result is proved: Consider a random graph on n vertices where each ?'zitex chooses randomIy a set of c neigh~rs. If c 26, then the graph has a l-factor, with probability + 1 as tt ---, ~0.

On the minimum local-vertex-connectivity
On the minimum local-vertex-connectivity augmentation in graphs
✍ Hiroshi Nagamochi; Toshimasa Ishii 📂 Article 📅 2003 🏛 Elsevier Science 🌐 English ⚖ 179 KB

Given a graph G and target values r(u; v) prescribed for each pair of vertices u and v, we consider the problem of augmenting G by a smallest set F of new edges such that the resulting graph G+F has at least r(u; v) internally disjoint paths between each pair of vertices u and v. We show that the pr

On vertex critical graphs with prescribe
On vertex critical graphs with prescribed diameter
✍ L. Caccetta; S. EL-Batanouny; J. Huang 📂 Article 📅 2003 🏛 John Wiley and Sons 🌐 English ⚖ 167 KB 👁 1 views

## Abstract Let __G__ be connected simple graph with diameter __d__(__G__). __G__ is said __v__^+^‐critical if __d__(__G__−__v__) is greater than __d__(__G__) for every vertex __v__ of __G__. Let D′ = max {__d__(__G__−__v__) : __v__ ∈ __V__(__G__)}. Boals et al. [Congressus Numerantium 72 (1990), 1