Given an undirected network G(V,A,c) and a perfect matching M of G, the inverse maximum perfect matching problem consists of modifying minimally the elements of c so that M becomes a maximum perfect matching with respect to the modified vector. In this article, we consider the inverse problem when the modifications are measured by the weighted bottleneck-type Hamming distance. We propose an alg...

We will extend Reed's Semi-Strong Perfect Graph Theorem by proving that unbreakable C 5-free graphs diierent from a C 6 and its complement have unique P 4-structure.

Inspired by a recent work of Buchweitz and Flenner, we show that, for a semidualizing bimodule $C$, $C$--perfect complexes have the ability to detect when a ring is strongly regular.It is shown that there exists a class of modules which admit minimal resolutions of $C$--projective modules.

The Wonderful Lemma, that was first proved by Roussel and Rubio, is one of the most important tools in the proof of the Strong Perfect Graph Theorem. Here we give a short proof of this lemma.

Deregulation policy has caused some changes in the concepts of power system reliability assessment. This paper deals with generation reliability evaluation in perfect competition power market using market economic concepts and its dynamic. Also, because of power markets and generators’ forced outages stochastic behavior, Monte Carlo Simulation (MCS) is used in this research. Generation reliabil...

In this paper we define the concept of clique number of uniform hypergraph and study its relationship with circular chromatic number and clique number. For every positive integer k,p and q, 2q ≤ p we construct a k-uniform hypergraph H with small clique number whose circular chromatic number equals p q . We define the concept and study the properties of c-perfect k-uniform hypergraphs .

A c-ary Perfect Factor is a set of uniformly long cycles whose elements are drawn from a set of size c, in which every possible v-tuple of elements occurs exactly once. In the binary case, i.e. where c = 2, these perfect factors have previously been studied by Etzion, [2], who showed that the obvious necessary conditions for their existence are in fact sufficient. This result has recently been ...