In this article, we address the scheduling problem in wireless ad hoc networks by exploiting computational advantage that comes when problems can be represented claw-free conflict graphs where consider a broadcast medium. It is possible to formulate of transmissions as finding maximum weighted independent set (MWIS) graph network. Finding MWIS general NP-hard leading an complexity scheduling. g...

The edge clique cover number ecc ( G ) of a graph is the size smallest collection complete subgraphs whose union covers all edges G. Chen, Jacobson, Kézdy, Lehel, Scheinerman, and Wang conjectured in 2000 that if claw-free, then bounded above by its order (denoted n). Recently, Javadi Hajebi verified this conjecture for claw-free graphs with an independence at least three. We study two, which a...

Devil's claw (Harpagophytum procumbens): pharmacological and clinical studies SIR, Over the last few years a number of reports have appeared in local newpapers in the North of England and Scotland claiming 'miraculous' results for treatment with devil's claw in patients with both adult and juvenile rheumatoid arthritis.1 2The preparation used was a tablet prepared from an aqueous extract of the...

The paper presents the tridimensional analysis of electromagnetic field of an claw poles alternator, in whose construction has been used non-magnetic material, such aluminum, that form the rings in the rotor’s structure. This structure aims to establish lower levels of saturation in the claw-pole of Lundell alternator. Reducing the level of saturation in the rotor, lead to reduction of the loss...

Hadwiger’s conjecture states that every graph with chromatic number χ has a clique minor of size χ. In this paper we prove a weakened version of this conjecture for the class of claw-free graphs (graphs that do not have a vertex with three pairwise nonadjacent neighbors). Our main result is that a claw-free graph with chromatic number χ has a clique minor of size ⌈23χ⌉.

We present a polynomial-time algorithm that given two independent sets in a claw-free graph G decides whether one can be transformed into the other by a sequence of elementary steps. Each elementary step is to remove a vertex v from the current independent set S in the sequence and to add a new vertex w (not in S) such that the set S−v+w is independent

A graph is a quasi-line graph if for every vertex v, the set of neighbours of v is expressible as the union of two cliques. Such graphs are more general than line graphs, but less general than claw-free graphs. Here we give a construction for all quasi-line graphs; it turns out that there are basically two kinds of connected quasi-line graphs, one a generalization of line graphs, and the other ...

Every n-vertex graph has two vertices with the same degree (if n ≥ 2). In general, let rep(G) be the maximum multiplicity of a vertex degree in G. An easy counting argument yields rep(G) ≥ n/(2d − 2s + 1), where d is the average degree and s is the minimum degree of G. Equality can hold when 2d is an integer, and the bound is approximately sharp in general, even when G is restricted to be a tre...