Bounds on the Clique and the Independence Number for Certain Classes of Graphs

Author:

Brimkov Valentin E.1,Barneva Reneta P.2

Affiliation:

1. Mathematics Department, SUNY Buffalo State, Buffalo, NY 14222, USA

2. School of Business, State University of New York at Fredonia, Fredonia, NY 14063, USA

Abstract

In this paper, we study the class of graphs Gm,n that have the same degree sequence as two disjoint cliques Km and Kn, as well as the class G¯m,n of the complements of such graphs. The problems of finding a maximum clique and a maximum independent set are NP-hard on Gm,n. Therefore, looking for upper and lower bounds for the clique and independence numbers of such graphs is a challenging task. In this article, we obtain such bounds, as well as other related results. In particular, we consider the class of regular graphs, which are degree-equivalent to arbitrarily many identical cliques, as well as such graphs of bounded degree.

Publisher

MDPI AG

Reference33 articles.

1. The irregularity of a graph;Albertson;Ars Comb.,1997

2. Regular subgraphs of almost regular graphs;Alon;J. Comb. Theory Ser. B,1984

3. Factors of locally almost regular graphs;Joentgen;Bull. Lond. Math. Soc.,1991

4. Macon, L. (2009). Almost Regular Graphs and Edge Face Colorings of Plane Graphs. [Ph.D. Thesis, University of Central].

5. Semi-regular graphs of minimum independence number;Nelson;Discret. Math.,2004

同舟云学术

1.学者识别学者识别

2.学术分析学术分析

3.人才评估人才评估

"同舟云学术"是以全球学者为主线,采集、加工和组织学术论文而形成的新型学术文献查询和分析系统,可以对全球学者进行文献检索和人才价值评估。用户可以通过关注某些学科领域的顶尖人物而持续追踪该领域的学科进展和研究前沿。经过近期的数据扩容,当前同舟云学术共收录了国内外主流学术期刊6万余种,收集的期刊论文及会议论文总量共计约1.5亿篇,并以每天添加12000余篇中外论文的速度递增。我们也可以为用户提供个性化、定制化的学者数据。欢迎来电咨询!咨询电话:010-8811{复制后删除}0370

www.globalauthorid.com

TOP

Copyright © 2019-2024 北京同舟云网络信息技术有限公司
京公网安备11010802033243号  京ICP备18003416号-3