✦ LIBER ✦

Disconnected Complements of Steinhaus graphs

✍ Scribed by Wayne M. Dymàček; Matthew Koerlin; Jean-Guy Speton; Tom Whaley; Jennifer Yanulavich

Publisher: Elsevier Science
Year: 2002
Tongue: English
Weight: 548 KB
Volume: 11
Category: Article
ISSN: 1571-0653
DOI: 10.1016/s1571-0653(04)00067-8

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Characterizations of bipartite Steinhaus

Characterizations of bipartite Steinhaus graphs

✍ Gerard J. Chang; Bhaskar DasGupta; Wayne M. Dymàček; Martin Fürer; Matthew Koerl 📂 Article 📅 1999 🏛 Elsevier Science 🌐 English ⚖ 821 KB

We characterize bipartite Steinhaus graphs in three ways by partitioning them into four classes and we describe the color sets for each of these classes. An interesting recursion had previously been given for the number of bipartite Steinhaus graphs and we give two fascinating closed forms for this

Probability of diameter two for Steinhau

Probability of diameter two for Steinhaus graphs

✍ Neal Brand; Stephen Curran; Sajal Das; Tom Jacob 📂 Article 📅 1993 🏛 Elsevier Science 🌐 English ⚖ 454 KB

Some characterizations of graphs by star

Some characterizations of graphs by star complements

✍ Dragoš Cvetković; Peter Rowlinson; Slobodan K. Simić 📂 Article 📅 1999 🏛 Elsevier Science 🌐 English ⚖ 158 KB

Let µ be an eigenvalue of the graph G with multiplicity k. A star complement for µ in G is an induced subgraph H = G -X such that |X| = k and µ is not an eigenvalue of G -X. Various graphs related to (generalized) line graphs or their complements are characterized by star complements corresponding t

Clique-transversal sets of line graphs a

Clique-transversal sets of line graphs and complements of line graphs

✍ Thomas Andreae; Martin Schughart; Zsolt Tuza 📂 Article 📅 1991 🏛 Elsevier Science 🌐 English ⚖ 704 KB

Andreae, T., M. Schughart and Z. Tuza, Clique-transversal sets of line graphs and complements of line graphs, Discrete Mathematics 88 (1991) 11-20. A clique-transversal set T of a graph G is a set of vertices of G such that T meets all maximal cliques of G. The clique-transversal number, denoted t,(

The edge reconstruction number of a disc

The edge reconstruction number of a disconnected graph

✍ Robert Molina 📂 Article 📅 1995 🏛 John Wiley and Sons 🌐 English ⚖ 532 KB

Hyperbolicity and complement of graphs

✍ Sergio Bermudo; José M. Rodríguez; José M. Sigarreta; Eva Tourís 📂 Article 📅 2011 🏛 Elsevier Science 🌐 English ⚖ 280 KB

If X is a geodesic metric space and x 1 , x 2 , x 3 ∈ X , a geodesic triangle T = {x 1 , x 2 , x 3 } is the union of the three geodesics [x 1 x 2 ], [x 2 x 3 ] and [x 3 x 1 ] in X . The space X is δ-hyperbolic (in the Gromov sense) if any side of T is contained in a δ-neighborhood of the union of th