✦ LIBER ✦

On distance subgraphs of graphs in spaces of lower dimensions

✍ Scribed by A. M. Raigorodskii, M. V. Titova

Book ID: 118804151
Publisher: Springer US
Year: 2012
Tongue: English
Weight: 158 KB
Volume: 187
Category: Article
ISSN: 1573-8795
DOI: 10.1007/s10958-012-1067-x

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

On the realization of random graphs as d

On the realization of random graphs as distance graphs in spaces of fixed dimension

✍ S. V. Nagaeva; A. M. Raigorodskii 📂 Article 📅 2009 🏛 SP MAIK Nauka/Interperiodica 🌐 English ⚖ 160 KB

On bipartite distance-regular graphs wit

On bipartite distance-regular graphs with a strongly closed subgraph of diameter three

✍ Qian Kong; Kaishun Wang 📂 Article 📅 2010 🏛 Elsevier Science 🌐 English ⚖ 216 KB

Lower Bounds on the Distortion of Embedd

Lower Bounds on the Distortion of Embedding Finite Metric Spaces in Graphs

✍ Y. Rabinovich; R. Raz 📂 Article 📅 1998 🏛 Springer 🌐 English ⚖ 176 KB

On the existence of certain subgraphs in

On the existence of certain subgraphs in infinite graphs

✍ G.A Dirac; C Thomassen 📂 Article 📅 1974 🏛 Elsevier Science ⚖ 284 KB

On embedding of graphs into euclidean sp

On embedding of graphs into euclidean spaces of small dimension

✍ J Reiterman; V Rödl; E S̆in̆ajová 📂 Article 📅 1992 🏛 Elsevier Science 🌐 English ⚖ 400 KB

An Application of a Construction Theory

An Application of a Construction Theory of Strongly Closed Subgraphs in a Distance-regular Graph

✍ A. Hiraki 📂 Article 📅 1999 🏛 Elsevier Science 🌐 English ⚖ 112 KB

## Let be a distance-regular graph with where r ≥ 2 and c r +1 > 1. We prove that r = 2 except for the case a 1 = a r +1 = 0 and c r +1 = 2 by showing the existence of strongly closed subgraphs.