Replacing cliques by stars in quasi-median graphs

نویسندگان

  • Katharina T. Huber
  • Vincent Moulton
  • Charles Semple
چکیده

For a multi-set E of splits {bipartitions) of a finite set X, we introduce the multi-split graph G(E). This graph Is a natural extension of the Buneman graph. Indeed, it is shown that several results pertaining to the Buneman graph extend to the multi-split graph. In addition, in case E is derived from a set R of partitions of X by taking parts together with their complements, we show that the extremal instances where R is either strongly compatible or strongly incompatible are equivalent to G(E) being either a tree or a Cartesian product of star trees, respectively.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A New Facet Generating Procedure for the Stable Set Polytope

We introduce a new facet-generating procedure for the stable set polytope, based on replacing (k− 1)-cliques with certain k-partite graphs, which subsumes previous procedures based on replacing vertices with stars, and thus also many others in the literature. It can be used to generate new classes of facet-defining inequalities.

متن کامل

Extremal Graphs for Blow-Ups of Cycles and Trees

The blow-up of a graph H is the graph obtained from replacing each edge in H by a clique of the same size where the new vertices of the cliques are all different. Erdős et al. and Chen et al. determined the extremal number of blow-ups of stars. Glebov determined the extremal number and found all extremal graphs for blowups of paths. We determine the extremal number and find the extremal graphs ...

متن کامل

Effective Pruning Techniques for Mining Quasi-Cliques

Many real-world datasets, such as biological networks and social networks, can be modeled as graphs. It is interesting to discover densely connected subgraphs from these graphs, as such subgraphs represent groups of objects sharing some common properties. Several algorithms have been proposed to mine quasi-cliques from undirected graphs, but they have not fully utilized the minimum degree const...

متن کامل

Computational Challenges with Cliques, Quasi-cliques and Clique Partitions in Graphs

During the last decade, many problems in social, biological, and financial networks require finding cliques, or quasi-cliques. Cliques or clique partitions have also been used as clustering or classification tools in data sets represented by networks. These networks can be very large and often massive and therefore external (or semi-external) memory algorithms are needed. We discuss four applic...

متن کامل

Hadwiger's conjecture for quasi-line graphs

A graph G is a quasi-line graph if for every vertex v ∈ V (G), the set of neighbors of v in G can be expressed as the union of two cliques. The class of quasi-line graphs is a proper superset of the class of line graphs. Hadwiger’s conjecture states that if a graph G is not t-colorable then it contains Kt+1 as a minor. This conjecture has been proved for line graphs by Reed and Seymour [10]. We...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • Discrete Applied Mathematics

دوره 143  شماره 

صفحات  -

تاریخ انتشار 2004