RESOLUTION OF UNMIXED BIPARTITE GRAPHS

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

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

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

منابع مشابه

Resolution of Unmixed Bipartite Graphs

For an unmixed bipartite graph G we consider the lattice of vertex covers LG and compute depth, projective dimension and extremal Bettinumbers of R/I(G) in terms of this lattice.

متن کامل

Unmixed Bipartite Graphs and Sublattices of the Boolean Lattices

The correspondence between unmixed bipartite graphs and sublattices of the Boolean lattice is discussed. By using this correspondence, we show the existence of squarefree quadratic initial ideals of toric ideals arising from minimal vertex covers of unmixed bipartite graphs.

متن کامل

Unmixed $r$-partite graphs

‎Unmixed bipartite graphs have been characterized by Ravindra and‎ ‎Villarreal independently‎. ‎Our aim in this paper is to‎ ‎characterize unmixed $r$-partite graphs under a certain condition‎, ‎which is a generalization of Villarreal's theorem on bipartite‎ ‎graphs‎. ‎Also, we give some examples and counterexamples in relevance to this subject‎.

متن کامل

A generalization of Villarreal's result for unmixed tripartite graphs

‎In this paper we give a characterization of unmixed tripartite‎ ‎graphs under certain conditions which is a generalization of a‎ ‎result of Villarreal on bipartite graphs‎. ‎For bipartite graphs two‎ ‎different characterizations were given by Ravindra and Villarreal‎. ‎We show that these two characterizations imply each other‎.

متن کامل

META-HEURISTIC ALGORITHMS FOR MINIMIZING THE NUMBER OF CROSSING OF COMPLETE GRAPHS AND COMPLETE BIPARTITE GRAPHS

The minimum crossing number problem is among the oldest and most fundamental problems arising in the area of automatic graph drawing. In this paper, eight population-based meta-heuristic algorithms are utilized to tackle the minimum crossing number problem for two special types of graphs, namely complete graphs and complete bipartite graphs. A 2-page book drawing representation is employed for ...

متن کامل

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


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

ژورنال

عنوان ژورنال: Bulletin of the Korean Mathematical Society

سال: 2015

ISSN: 1015-8634

DOI: 10.4134/bkms.2015.52.3.977