Results 31 to 40 of about 8,623,913 (295)
Rainbow Turán number of clique subdivisions
European Journal of Combinatorics, 2023 We show that for any integer $t\geq 2$, every properly edge-coloured graph on $n$ vertices with more than $n^{1+o(1)}$ edges contains a rainbow subdivision of $K_t$. Note that this bound on the number of edges is sharp up to the $o(1)$ error term. This is a rainbow analogue of some classical results on clique subdivisions and extends some results on ...
Tao Jiang 0003 +2 more
openaire +3 more sources
0053 | Clique Number in Neutrosophic Graphs
, 2022 New setting is introduced to study neutrosophic clique number and clique neutrosophic-number arising neighborhood of different vertices. Neighbor is a key term to have these notions.
Henry Garrett
core +1 more source
Hard optimization problems have soft edges
Scientific Reports, 2023 Finding a Maximum Clique is a classic property test from graph theory; find any one of the largest complete subgraphs in an Erdös-Rényi G(N, p) random graph. We use Maximum Clique to explore the structure of the problem as a function of N, the graph size,
Raffaele Marino, Scott Kirkpatrick
doaj +1 more source
Eternal domination and clique covering
Electronic Journal of Graph Theory and Applications, 2022 We study the relationship between the eternal domination number of a graph and its clique cove-ring number using both large-scale computation and analytic methods. In doing so, we answer two open questions of Klostermeyer and Mynhardt.
Gary MacGillivray +2 more
doaj +1 more source
On the Clique Number of a Strongly Regular Graph [PDF]
The Electronic Journal of Combinatorics, 2018 We determine new upper bounds for the clique numbers of strongly regular graphs in terms of their parameters. These bounds improve on the Delsarte bound for infinitely many feasible parameter tuples for strongly regular graphs, including infinitely many parameter tuples that correspond to Paley graphs.
Gary R. W. Greaves, Leonard H. Soicher
openaire +4 more sources
On a class of polynomials associated with the Cliques in a graph and its applications
International Journal of Mathematics and Mathematical Sciences, 1989 The clique polynomial of a graph is defined. An explicit formula is then derived for the clique polynomial of the complete graph. A fundamental theorem and a reduction process is then given for clique polynomials.
E. J. Farrell
doaj +1 more source
On the Maximum Number of Cliques in a Graph [PDF]
Graphs and Combinatorics, 2007 A \emph{clique} is a set of pairwise adjacent vertices in a graph. We determine the maximum number of cliques in a graph for the following graph classes: (1) graphs with $n$ vertices and $m$ edges; (2) graphs with $n$ vertices, $m$ edges, and maximum degree $Δ$; (3) $d$-degenerate graphs with $n$ vertices and $m$ edges; (4) planar graphs with $n ...
openaire +4 more sources
An optimization algorithm for maximum quasi-clique problem based on information feedback model [PDF]
PeerJ Computer ScienceThe maximum clique problem in graph theory is a well-known challenge that involves identifying the complete subgraph with the highest number of nodes in a given graph, which is a problem that is hard for nondeterministic polynomial time (NP-hard problem).
Shuhong Liu +4 more
doaj +2 more sources
Connected Domination Number and a New Invariant in Graphs with Independence Number Three [PDF]
Computer Science Journal of Moldova, 2021 Adding a connected dominating set of vertices to a graph $G$ increases its number of Hadwiger $h(G)$. Based on this obvious property in [2] we introduced a new invariant $\eta(G)$ for which $\eta(G)\leq h(G)$. We continue to study its property.
Vladimir Bercov
doaj
Automorphisms and Distinguishing Numbers of Geometric Cliques [PDF]
Discrete & Computational Geometry, 2008 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Michael O. Albertson, Debra L. Boutin
openaire +3 more sources