𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Complementary ℓ1-Graphs Embeddable in the Half-Cube

✍ Scribed by M.C. Marcusanu

Publisher
Elsevier Science
Year
2002
Tongue
English
Weight
221 KB
Volume
23
Category
Article
ISSN
0195-6698

No coin nor oath required. For personal study only.

✦ Synopsis

A finite connected graph is called an 1 -graph if it can be isometrically embedded into the space 1 . We complete the classification of pairs of complementary 1 -graphs started by Deza and Huang, and continued by Shpectorov.

📜 SIMILAR VOLUMES

Dilation-free graphs in the l1 metric
Dilation-free graphs in the l1 metric
✍ J. Cáceres; C.I. Grima; A. Márquez; A. Moreno-González 📂 Article 📅 2007 🏛 John Wiley and Sons 🌐 English ⚖ 164 KB
On quadrilaterals in layers of the cube
On quadrilaterals in layers of the cube and extremal problems for directed and oriented graphs
✍ Schelp, Richard H.; Thomason, Andrew 📂 Article 📅 2000 🏛 John Wiley and Sons 🌐 English ⚖ 286 KB 👁 2 views

Erdős has conjectured that every subgraph of the n-cube Q n having more than (1/2+o(1))e(Q n ) edges will contain a 4-cycle. In this note we consider 'layer' graphs, namely, subgraphs of the cube spanned by the subsets of sizes k -1, k and k + 1, where we are thinking of the vertices of Q n as being

The multiplicity of 1-factors in the squ
The multiplicity of 1-factors in the square of a graph
✍ G. R. T. Hendry 📂 Article 📅 1984 🏛 John Wiley and Sons 🌐 English ⚖ 225 KB 👁 1 views

Several authors have shown that if G is a connected graph of even order then its square G2 has a I-factor. We show that the square of any connected graph of order 2n has at least n I-factors and describe all the extremal graphs.

The structure of max ?-minm?+1 graphs us
The structure of max ?-minm?+1 graphs used in the design of reliable networks
✍ Wang, Guifang; Zhang, Lianzhu 📂 Article 📅 1997 🏛 John Wiley and Sons 🌐 English ⚖ 235 KB 👁 1 views

It was proved that the design problem of the reliable networks for ''small'' edge failure probability is equivalent to finding a max l-min m l graph for given numbers of nodes n and edges e with l Å [2e/n] by Bauer et al. Furthermore, at least a max l-min m l graph was given for each pair of n and e