Results 81 to 90 of about 8,766 (207)
Maximum Cliques in Graphs with Small Intersection Number and Random Intersection Graphs [PDF]
, 2012 Sotiris Nikoletseas +2 more
openalex +1 more source
AKCE International Journal of Graphs and CombinatoricsThe computation of the clique number of a graph is a fundamental problem in graph theory, which has many applications in computational chemistry, bioinformatics, computer, and social networking.
Ying Wang +5 more
doaj +1 more source
Packing Cliques in Graphs with Independence Number 2 [PDF]
Combinatorics, Probability and Computing, 2007 Let G be a graph with no three independent vertices. How many edges of G can be packed with edge-disjoint copies of K k ? More specifically, let f k (n, m) be the largest integer t such that, for any graph with n vertices, m edges, and independence number 2, at least t edges can be packed with edge-disjoint copies of K k
openaire +1 more source
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 +1 more source
The bounds of the spectral radius of general hypergraphs in terms of clique number [PDF]
, 2020 Cunxiang Duan, Ligong Wang
openalex +1 more source
Discussiones Mathematicae Graph Theory, 2019 Let G be a connected graph with minimum degree δ and edge-connectivity λ. A graph is maximally edge-connected if λ = δ, and it is super-edgeconnected if every minimum edge-cut is trivial; that is, if every minimum edge-cut consists of edges incident with
Volkmann Lutz
doaj +1 more source
Clique number of the square of a line graph [PDF]
, 2015 Małgorzata Śleszyńska-Nowak
openalex +1 more source
0036 | Clique Number in Neutrosophic Graphs
, 2022 In this book, some notions are introduced about Independence in Neutrosophic Graphs. Three chapters are devised as Common Notions , Modified Notions and Extended Notions . Three manuscripts are cited as the references of these chapters which are my 53rd, 54th, and 55th manuscripts.
openaire +1 more source
A constant amortized time enumeration algorithm for independent sets in graphs with bounded clique number [PDF]
, 2021 Kazuhiro Kurita +3 more
openalex +1 more source
Treewidth versus clique number: induced minors
We prove that a hereditary class of graphs is $(\mathsf{tw}, ω)$-bounded if and only if the induced minors of the graphs from the class form a $(\mathsf{tw}, ω)$-bounded class.
Hilaire, Claire +3 more
openaire +2 more sources