𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Independence numbers of product graphs

✍ Scribed by P.K. Jha; G. Slutzki

Publisher
Elsevier Science
Year
1994
Tongue
English
Weight
301 KB
Volume
7
Category
Article
ISSN
0893-9659

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

Circumferences of k-connected graphs inv
Circumferences of k-connected graphs involving independence numbers
✍ Guantao Chen; Zhiquan Hu; Yaping Wu πŸ“‚ Article πŸ“… 2010 πŸ› John Wiley and Sons 🌐 English βš– 211 KB πŸ‘ 1 views

Let G be a k-connected graph of order n, := (G) the independence number of G, and c(G) the circumference of G. ChvΓ‘tal and Erdo ˝s proved that if ≀ k then G is hamiltonian. For β‰₯ k β‰₯ 2, Fouquet and Jolivet in 1978 made the conjecture that c(G) β‰₯ k(n+ -k) / . Fournier proved that the conjecture is tr

On graphs with subgraphs having large in
On graphs with subgraphs having large independence numbers
✍ Noga Alon; Benny Sudakov πŸ“‚ Article πŸ“… 2007 πŸ› John Wiley and Sons 🌐 English βš– 131 KB

## Abstract Let __G__ be a graph on __n__ vertices in which every induced subgraph on ${s}={\log}^{3}\, {n}$ vertices has an independent set of size at least ${t}={\log}\, {n}$. What is the largest ${q}={q}{(n)}$ so that every such __G__ must contain an independent set of size at least __q__? This

Independence number in n-extendable grap
Independence number in n-extendable graphs
✍ Peter Maschlanka; Lutz Volkmann πŸ“‚ Article πŸ“… 1996 πŸ› Elsevier Science 🌐 English βš– 756 KB

Let G be a connected graph with p vertices and n a positive integer with 1 dn <(p/2) -1. G is said to be O-extendable if G has a perfect matching. G is said to be n-extendable if G has a matching of size n and every matching of size n in G extends to (i.e. is a subset of) a perfect matching. It is s