✦ LIBER ✦

Partial Complement of a Graph

✍ Scribed by H.B. Walikar

Publisher: Elsevier Science
Year: 2003
Tongue: English
Weight: 172 KB
Volume: 15
Category: Article
ISSN: 1571-0653
DOI: 10.1016/s1571-0653(04)00588-8

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

A generalization of hypercubes: Compleme

A generalization of hypercubes: Complemented graphs

✍ J. Nieminen; M. Peltola 📂 Article 📅 1999 🏛 Elsevier Science 🌐 English ⚖ 486 KB

## Communicated by A. Tucker Abstract--Complemented graphs are a direct generalization of hypercubes as well as a special class of prime convex intersection graphs. The n-tuple representation of points of a hypercube Qn is extended to prime convex intersection graphs.

Packing triangles in a graph and its com

Packing triangles in a graph and its complement

✍ Peter Keevash; Benny Sudakov 📂 Article 📅 2004 🏛 John Wiley and Sons 🌐 English ⚖ 127 KB 👁 1 views

## Abstract How few edge‐disjoint triangles can there be in a graph __G__ on __n__ vertices and in its complement $\overline {G}$? This question was posed by P. Erdős, who noticed that if __G__ is a disjoint union of two complete graphs of order __n__/2 then this number is __n__^2^/12 + __o__(__n__

About triangles in a graph and its compl

About triangles in a graph and its complement

✍ B. Radhakrishnan Nair; A. Vijayakumar 📂 Article 📅 1994 🏛 Elsevier Science 🌐 English ⚖ 338 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

Disconnected Complements of Steinhaus gr

Disconnected Complements of Steinhaus graphs

✍ Wayne M. Dymàček; Matthew Koerlin; Jean-Guy Speton; Tom Whaley; Jennifer Yanulav 📂 Article 📅 2002 🏛 Elsevier Science 🌐 English ⚖ 548 KB

Some parameters of graph and its complem

Some parameters of graph and its complement

✍ Shao-ji Xu 📂 Article 📅 1987 🏛 Elsevier Science 🌐 English ⚖ 627 KB

In this paper, we have discussed the Nordhaus-Gaddum problems for diameter d, girth g, circumference c and edge covering number ill-We have both got the following results. If both G and G are connected, then 4<~d+a~~ 6, then p+2<.c+~<.2p, 3(p-1)<~c.~<.p 2. If both G and G have no isolated vertex, th