Disjoint cliques in regular graphs of degree seven and eight
نویسندگان
چکیده
This paper is motivated by Berge’s conjecture that every undirectefl regular graph, except the complement of a complete graph, has at least two disjoint maximal independent sets of vertices. By complementation this is equivalent to the conjecture that every incomplete regular graph has two or more disjoint cliques. In [l], we established this form of the conjecture for regular graphs of degree < 6. Here we prove that incomplete graphs of degree 7 or 8 possess disjoint cliques. Any terminology or notation undefined in this paper may be found in Harary’s book [2].
منابع مشابه
Cohen-Macaulay $r$-partite graphs with minimal clique cover
In this paper, we give some necessary conditions for an $r$-partite graph such that the edge ring of the graph is Cohen-Macaulay. It is proved that if there exists a cover of an $r$-partite Cohen-Macaulay graph by disjoint cliques of size $r$, then such a cover is unique.
متن کاملSplice Graphs and their Vertex-Degree-Based Invariants
Let G_1 and G_2 be simple connected graphs with disjoint vertex sets V(G_1) and V(G_2), respectively. For given vertices a_1in V(G_1) and a_2in V(G_2), a splice of G_1 and G_2 by vertices a_1 and a_2 is defined by identifying the vertices a_1 and a_2 in the union of G_1 and G_2. In this paper, we present exact formulas for computing some vertex-degree-based graph invariants of splice of graphs.
متن کاملMatching Integral Graphs of Small Order
In this paper, we study matching integral graphs of small order. A graph is called matching integral if the zeros of its matching polynomial are all integers. Matching integral graphs were first studied by Akbari, Khalashi, etc. They characterized all traceable graphs which are matching integral. They studied matching integral regular graphs. Furthermore, it has been shown that there is no matc...
متن کاملRegular clique covers of graphs
A family of cliques in a graph G is said to be p-regular if any two cliques in the family intersect in exactly p vertices. A graph G is said to have a p-regular k-clique cover if there is a p-regular family H of k-cliques of G such that each edge of G belongs to a clique in H. Such a p-regular kclique cover is separable if the complete subgraphs of order p that arise as intersections of pairs o...
متن کاملThe superregular graphs
A regular graph is superregular if it has no vertices or if the subgraphs induced by the neighbors and by the nonneighbors of each vertex are superreg-ular. The superregular graphs are precisely the disjoint union of m isomorphic cliques, the Cartesian product of two isomorphic cliques, the ve-cycle, and the complements of these graphs.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- J. Comb. Theory, Ser. B
دوره 24 شماره
صفحات -
تاریخ انتشار 1978