Results 11 to 20 of about 8,623,913 (295)
A Transformation Which Preserves the Clique Number [PDF]
Journal of Combinatorial Theory, Series B, 2001 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Michael U. Gerber, Alain Hertz
openaire +2 more sources
Computing the clique number of tournaments
CoRRThe clique number of a tournament is the maximum clique number of a graph formed by keeping backwards arcs in an ordering of its vertices. We study the time complexity of computing the clique number of a tournament and prove that, for any integer $k \geq 3$, deciding whether a tournament has clique number at most $k$ is NP-complete.
Aubian, Guillaume
openaire +4 more sources
Extremal Sombor Index of Graphs with Cut Edges and Clique Number
AxiomsThe Sombor index is defined as SO(G)=∑uv∈E(G)d2(u)+d2(v), where d(u) and d(v) represent the number of edges in the graph G connected to the vertices u and v, respectively.
Mihrigul Wali, Raxida Guji
doaj +2 more sources
Sweeping graphs with large clique number [PDF]
Discrete Mathematics, 2009 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Boting Yang, Danny Dyer, Brian Alspach
openaire +4 more sources
On the number of distinct minimal clique partitions and clique covers of a line graph [PDF]
Discrete Mathematics, 1990 Let \(G\) be a graph. Then \(cc(G)\) \((cp(G))\), the clique covering (the clique partition) number of \(G\) is the minimum number of cliques of \(G\) that cover (partition) all edges of \textit{G. Orlin} [Nederl. Akad. Wet., Proc., Ser. A 80, Indag. Math.
Sean McGuinness, Rolf S. Rees
openaire +4 more sources
A Note on the Signed Clique Domination Numbers of Graphs
Journal of Mathematics, 2022 Let G=V,E be a graph. A function f:E⟶−1,+1 is said to be a signed clique dominating function (SCDF) of G if ∑e∈EKfe≥1 holds for every nontrivial clique K in G. The signed clique domination number of G is defined as γscl′G=min∑e∈EGfe|fis an SCDF ofG.
Baogen Xu, Ting Lan, Mengmeng Zheng
doaj +1 more source
General multiplicative Zagreb indices of graphs with given clique number [PDF]
Opuscula Mathematica, 2019 We obtain lower and upper bounds on general multiplicative Zagreb indices for graphs of given clique number and order. Bounds on the basic multiplicative Zagreb indices and on the multiplicative sum Zagreb index follow from our results. We also determine
Tomáš Vetrík, Selvaraj Balachandran
doaj +1 more source
Fast Diameter Computation within Split Graphs [PDF]
Discrete Mathematics & Theoretical Computer Science, 2021 When can we compute the diameter of a graph in quasi linear time? We address this question for the class of {\em split graphs}, that we observe to be the hardest instances for deciding whether the diameter is at most two.
Guillaume Ducoffe +2 more
doaj +1 more source
The jump of the clique chromatic number of random graphs [PDF]
, 2023 The clique chromatic number of a graph is the smallest number of colors in a vertex coloring so that no maximal clique is monochromatic. In 2016 McDiarmid, Mitsche and Pralat noted that around p asymptotic to n-(1/2) the clique chromatic number of the ...
Lutz Warnke +5 more
core +2 more sources
On graphs with equal coprime index and clique number
AKCE International Journal of Graphs and Combinatorics, 2023 Recently, Katre et al. introduced the concept of the coprime index of a graph. They asked to characterize the graphs for which the coprime index is the same as the clique number. In this paper, we partially solve this problem.
Chetan Patil +2 more
doaj +1 more source