In this paper we obtain more precise information by determining the maximum number of s -cliques of a graph with prescribed order, circumference and minimum ...
2021/12/03 · Erd˝os determined the maximum size of a nonhamiltonian graph of order n and minimum degree at least k in 1962.
2023/08/01 · In this paper we obtain more precise information by determining the maximum number of s-cliques of a graph with prescribed order, circumference ...
2021/07/03 · In this paper we obtain more precise information by determining the maximum size of a graph with prescribed order, circumference and minimum degree.
関連する質問
How do you determine the number of maximal cliques?
What is the maximum clique of a graph?
What is the maximum number of cliques in a planar graph?
How many cliques does a graph have?
TL;DR: In this paper , the maximum number of s-cliques of a k-connected graph with given order and circumference was determined, and the corresponding ...
The maximum number of cliques in graphs with prescribed order, circumference and minimum degree. Article. Aug 2023; EUR J COMBIN. Leilei Zhang · View.
In this work, we give the sharp upper bound for the number of cliques in graphs with bounded odd circumferences. This generalized Turán-type result is an ...
2020/08/26 · The matching number ν(G) is the number of edges in a maximum matching of G. The number of cliques of size s in G is denoted by Ns(G). Given ...
We give a new recursive method to compute the number of cliques and cycles of a graph. This method is related, respectively to the number of disjoint ...
A maximal clique with the maximum size is called a maximum clique. The number of vertices of a maximum clique in an induced subgraph G(R) is denoted by ω(R).
含まれない: prescribed circumference