𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Some relations between rank of a graph and its complement

✍ Scribed by Saieed Akbari; Alireza Alipour; Javad Ebrahimi Boroojeni; Ebrahim Ghorbani; Mirhamed Mirjalalieh Shirazi

Publisher
Elsevier Science
Year
2007
Tongue
English
Weight
136 KB
Volume
422
Category
Article
ISSN
0024-3795

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

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

The minimum number of subgraphs in a gra
The minimum number of subgraphs in a graph and its complement
✍ Lane Clark πŸ“‚ Article πŸ“… 1992 πŸ› John Wiley and Sons 🌐 English βš– 265 KB πŸ‘ 2 views

## Abstract For a graphb __F__ without isolated vertices, let __M__(__F__; __n__) denote the minimum number of monochromatic copies of __F__ in any 2‐coloring of the edges of __K__~__n__~. Burr and Rosta conjectured that when __F__ has order __t__, size __u__, and __a__ automorphisms. Independent