✦ LIBER ✦

Archimedean graph designs

✍ Scribed by Forbes, A.D.; Griggs, T.S.

Book ID: 122787895
Publisher: Elsevier Science
Year: 2013
Tongue: English
Weight: 584 KB
Volume: 313
Category: Article
ISSN: 0012-365X
DOI: 10.1016/j.disc.2011.11.012

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Archimedean ϕ -tolerance graphs

✍ Martin Charles Golumbic; Robert E. Jamison; Ann N. Trenk 📂 Article 📅 2002 🏛 John Wiley and Sons 🌐 English ⚖ 143 KB

## Abstract Let ϕ be a symmetric binary function, positive valued on positive arguments. A graph __G__ = (__V__,__E__) is a ϕ‐__tolerance graph__ if each vertex υ ∈ __V__ can be assigned a closed interval __I__~υ~ and a positive tolerance __t__~υ~ so that __xy__ ∈ __E__ ⇔ | __I__~x~ ∩ __I__~y~|≥ ϕ

Symmetric Graph Designs

✍ H.-D.O.F. Gronau; R.C. Mullin; A. Rosa; P.J. Schellenberg 📂 Article 📅 2000 🏛 Springer Japan 🌐 English ⚖ 142 KB

Regular graph designs

✍ W.D. Wallis 📂 Article 📅 1996 🏛 Elsevier Science 🌐 English ⚖ 344 KB

Thin Hamiltonian cycles on Archimedean g

Thin Hamiltonian cycles on Archimedean graphs

✍ John R Reay; D.G Rogers 📂 Article 📅 1995 🏛 Elsevier Science 🌐 English ⚖ 200 KB

Balance in graph-designs

✍ Ruini, Beatrice 📂 Article 📅 2013 🏛 Elsevier Science 🌐 English ⚖ 153 KB

Symmetric graph designs on friendship gr

Symmetric graph designs on friendship graphs

✍ Dalibor Fronc̆ek; Alexander Rosa 📂 Article 📅 2000 🏛 John Wiley and Sons 🌐 English ⚖ 105 KB 👁 1 views

graph designs on friendship graphs.