Results 71 to 80 of about 8,457 (169)

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  

On bounds for the atom bond sum connectivity index of graphs associated with symmetric numerical semigroups

AKCE International Journal of Graphs and Combinatorics
The 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, Anam Shahzadi, Muhammad Ahsan Binyamin, Maria Mehtab, Fairouz Tchier, Adnan Aslam   +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

Axioms
The 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

Cluster deletion and clique partitioning in graphs with bounded clique number

14 pages, 3 ...
Galesi, Nicola, Huynh, Tony, Ranjbar, Fariba   +2 more
openaire   +2 more sources

Sufficient Conditions for Maximally Edge-Connected and Super-Edge-Connected Graphs Depending on The Clique Number

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

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

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, Milanič, Martin, Trotignon, Nicolas, Vasić, Djordje   +3 more
openaire   +2 more sources

Complexity Results on Graphs with Few Cliques

Discrete Mathematics & Theoretical Computer Science, 2007
A graph class has few cliques if there is a polynomial bound on the number of maximal cliques contained in any member of the class. This restriction is equivalent to the requirement that any graph in the class has a polynomial sized intersection ...
Bill Rosgen, Lorna Stewart
doaj  

The Clique-Width of Minimal Series-Parallel Digraphs

Algorithms
MSP DAGs (short for minimal series-parallel digraphs) can be defined from the single vertex graph by applying the parallel composition and series composition.
Frank Gurski, Ruzayn Quaddoura
doaj   +1 more source