Results 271 to 280 of about 8,623,913 (295)

On connectivity in graphs with given clique number

Journal of Graph Theory, 2006
AbstractWe consider finite, undirected, and simple graphs G of order n(G) and minimum degree δ(G). The connectivity κ(G) for a connected graph G is defined as the minimum cardinality over all vertex‐cuts.If κ(G) < δ(G), then Topp and Volkmann 7 showed in 1993 for p‐partite graphs G that As a simple consequence, Topp and Volkmann obtained for p ...
Hellwig, Angelika (Dr. rer. nat.), Volkmann, Lutz   +1 more
openaire   +3 more sources

Estimation of the number of cliques in a random graph

Proceedings of the Third C* Conference on Computer Science and Software Engineering, 2010
This paper examines methods for predicting and estimating the number of maximal cliques in a random graph. A clique is a subgraph where each vertex is connected to every other vertex in the subgraph. A maximal clique is a clique which is not a proper subgraph of another clique.
Sonal Patel, Eric Harley
openaire   +2 more sources

Clique Chromatic Numbers of Intersection Graphs

Mathematical Notes, 2019
The clique chromatic number \(\chi_c(G)\) of a graph \(G\) is the minimum \(k\) for which there exists a \(k\)-coloring of the vertices of \(G\) such that all inclusion-maximal cliques, except for isolated vertices, are non-monochromatic. When \([n]=\{1,2,\dots,n\}\), \(G(n,r,s)\) is the graph whose vertex-set is \(\binom{[n]}{r}\), and whose edges ...
Zakharov, D. A., Raigorodskii, A. M.
openaire   +1 more source

An upper bound on the number of cliques in a graph

Networks, 1993
AbstractGiving a partial solution to a conjecture of Balas and Yu [Networks 19 (1989) 247–235], we prove that if the complement of a graph G on n vertices contains no set of t + 1 pairwise disjoint edges as an induced subgraph, then G has fewer than (n/2t)2t maximal complete subgraphs. © 1993 by John Wiley & Sons, Inc.
Martin Farber, Mihály Hujter, Zsolt Tuza   +2 more
openaire   +1 more source

On Generalized Turán Numbers of Intersecting Cliques

Graphs and Combinatorics
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Xiaoli Yuan, Yuejian Peng
openaire   +1 more source

On the number of pairs of orthogonal cliques of a graph

Proceedings of the annual conference on - ACM'73, 1973
For any set S of vertices of a graph G, we use to denote the induced subgraph, i.e., the maximal subgraph of G with the vertex set S. Let V be the set of all vertices of G. If both and are cliques of G, we say that and form a pair of orthogonal cliques of G.
openaire   +2 more sources

Clique transversal and clique independence on comparability graphs

Information Processing Letters, 1996
C Pandu Rangan
exaly  

Distance-hereditary graphs are clique-perfect

Discrete Applied Mathematics, 2006
Maw-Shang Chang, Chuan-Min Lee
exaly  

The icosahedron is clique divergent

Discrete Mathematics, 2003
MIGUEL Pizaña
exaly  

On the maximum quasi-clique problem

Discrete Applied Mathematics, 2013
Vladimir Boginski, Sergiy Butenko
exaly