Results 71 to 80 of about 8,766 (207)
Inequalities of Independence Number, Clique Number and Connectivity of Maximal Connected Domination Critical Graphs [PDF]
, 2019 Norah Almalki, Pawaton Kaemawichanurat
openalex +2 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. Having all possible edges amid vertices in a set is a key type of approach to have these notions namely neutrosophic clique number and clique neutrosophic-number.
openaire +1 more source
Treewidth versus clique number. III. Tree-independence number of graphs with a forbidden structure [PDF]
, 2022 Clément Dallard +2 more
openalex +1 more source
Some results on the independence number of connected domination critical graphs
AKCE International Journal of Graphs and Combinatorics, 2018 A --critical graph is a graph with connected domination number and for any pair of non-adjacent vertices and of . Let and be respectively the clique number and the independence number of a graph.
P. Kaemawichanurat, T. Jiarasuksakun
doaj +1 more source
The oriented relative clique number of triangle-free planar graphs is 10 [PDF]
, 2022 Soura Sena Das, Soumen Nandi, Sagnik Sen
openalex +1 more source
A polynomial bound on the number of minimal separators and potential maximal cliques in $P_6$-free graphs of bounded clique number [PDF]
Discrete Mathematics & Theoretical Computer ScienceIn this note we show a polynomial bound on the number of minimal separators and potential maximal cliques in $P_6$-free graphs of bounded clique number.
Marcin Pilipczuk, Paweł Rzążewski
doaj +1 more source
A generalization for the clique and independence numbers
The Electronic Journal of Linear Algebra, 2012 In this paper, lower and upper bounds for the clique and independence numbers are established in terms of the eigenvalues of the signless Laplacian matrix of a given graph G.
Maden (Gungor), A. Dilek +1 more
openaire +2 more sources
On the clique number of noisy random geometric graphs [PDF]
, 2022 Matthew Kahle, Minghao Tian, Yusu Wang
openalex +1 more source
The upper chromatic number of quasi-interval co-hypergraphs
Le Matematiche, 1997 We investigate the structural and colouring properties of clique hyper-graphs of interval graphs called the quasi-interval hypergraphs. We find the conditions when they are interval hypergraphs. The upper chromatic number for the clique co-hypergraphs of
Violeta Prisakaru
doaj