✦ LIBER ✦

ModelingK-coteries by well-covered graphs

✍ Scribed by Yamashita, Masafumi; Kameda, Tsunehiko (Tiko)

Publisher: John Wiley and Sons
Year: 1999
Tongue: English
Weight: 115 KB
Volume: 34
Category: Article
ISSN: 0028-3045
DOI: 10.1002/(sici)1097-0037(199910)34:3<221::aid-net7>3.0.co;2-m

No coin nor oath required. For personal study only.

✦ Synopsis

The concept of k-coterie is useful for achieving k-mutual exclusion in distributed systems. A graph is said to be well covered if any of its maximal independent sets is also maximum. We first show that a graph G is well covered with independence number k if and only if G represents the incidence relation among quorums forming a k-coterie. We then discuss the problem of constructing k-coteries having some desirable properties. We also characterize the well-covered graphs with independence number 2.

📜 SIMILAR VOLUMES

Subdivisions, parity and well-covered gr

Subdivisions, parity and well-covered graphs

✍ Caro, Yair 📂 Article 📅 1997 🏛 John Wiley and Sons 🌐 English ⚖ 121 KB 👁 2 views

A graph is well-covered if every maximal independent set is maximum. This concept, introduced by Plummer in 1970 (J. Combin. Theory 8 (1970)), is the focal point of much interest and current research. We consider well-covered 2-degenerate graphs and supply a structural (and polynomial time algorithm

Well covered simplicial, chordal, and ci

Well covered simplicial, chordal, and circular arc graphs

✍ Prisner, Erich; Topp, Jerzy; Vestergaard, Preben Dahl 📂 Article 📅 1996 🏛 John Wiley and Sons 🌐 English ⚖ 427 KB 👁 2 views

A graph G is called well covered if every two maximal independent sets of G have the same number of vertices. In this paper, we,characterize well covered simplicial, chordal and circular arc graphs.

Tracking the P-NP boundary for well-cove

Tracking the P-NP boundary for well-covered graphs

✍ Sankaranarayana, Ramesh S. 📂 Article 📅 1997 🏛 John Wiley and Sons 🌐 English ⚖ 135 KB 👁 1 views

Certain fundamental graph problems like recognition, dominating set, Hamiltonian cycle and path, and clique partition, which are hard for well-covered graphs in general, can be solved efficiently for very well covered graphs. We address the question of how far the class of very well covered graphs c

A characterization of Zm-well-covered gr

A characterization of Zm-well-covered graphs of girth 6 or more

✍ Caro, Y.; Hartnell, B. 📂 Article 📅 2000 🏛 John Wiley and Sons 🌐 English ⚖ 252 KB 👁 1 views

The class of Z m -well-covered graphs, those in which the cardinality of every maximal independent subset of vertices is congruent to the same number modulo m, contains the well-covered graphs as well as parity graphs. Here we consider such graphs, where there is no small cycle present and obtain a

Degree sums and graphs that are not cove

Degree sums and graphs that are not covered by two cycles

✍ Saito, Akira 📂 Article 📅 1999 🏛 John Wiley and Sons 🌐 English ⚖ 127 KB 👁 2 views

For a graph G, let σ 3 (G) = min{deg G x + deg G y + deg G z: {x, y, z} is an independent set in G}. Enomoto et al. [Enowoto et al., J Graph Theory 20 (1995), 419-422] have proved that the vertex set of a 2-connected graph G of order n with σ 3 (G) ≥ n is covered by two cycles, edges or vertices. Ex

Electronic Properties of InAs/GaAs Quant

Electronic Properties of InAs/GaAs Quantum Dots Covered by an InxGa1–xAs Quantum Well

✍ F. Guffarth; R. Heitz; A. Schliwa; O. Stier; A.R. Kovsh; V. Ustinov; N.N. Ledent 📂 Article 📅 2001 🏛 John Wiley and Sons 🌐 English ⚖ 112 KB 👁 1 views