Results 61 to 70 of about 8,457 (169)

Sweeping graphs with large clique number

Discrete Mathematics, 2009
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Yang, Boting, Dyer, Danny, Alspach, Brian   +2 more
openaire   +2 more sources

Bounds for graph energy in terms of vertex covering and clique numbers

Electronic Journal of Graph Theory and Applications, 2019
Let G be a simple graph with n vertices, m edges and having adjacency eigenvalues λ1, λ2, …, λn. The energy E(G) of the graph G is defined as E(G) = ∑i = 1n∣λi∣.
Hilal A. Ganie, U. Samee, S. Pirzada, Ahmad M. Alghamadi   +3 more
doaj   +1 more source

A FFT-Like MIMO Detection Algorithm

IEEE Access, 2020
This paper studies the multiple-input-multiple-output (MIMO) detection problem. Existing works model the MIMO detection as a tree or factor graph. This work adds a new member called the clique graph model to the MIMO detection graph model family so that ...
Peng Du, Yuan Zhang, Teer Ba
doaj   +1 more source

Circumference, Minimum Degree and Clique Number

The Electronic Journal of Combinatorics
The circumference and the clique number of a graph is the length of a longest cycle and the largest order of a clique in it respectively. We show that the circumference of a 2-connected non-Hamiltonian graph $G$ is at least the sum of its clique number and minimum degree unless $G$ is one of two specific graphs.
openaire   +1 more source

The clique number and some Hamiltonian properties of graphs [PDF]

Contributions to Mathematics, 2021
Rao Li
doaj   +1 more source

Small clique and large chromatic number

Electronic Notes in Discrete Mathematics, 2009
Abstract In this paper, we will exhibit old and new results concerning distance graphs with simaltaneously small clique and large chromatic numbers.
A.M. Raigorodskii, O.I. Rubanov
openaire   +1 more source

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

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

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 Science
In 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, Cevik, A. Sinan   +1 more
openaire   +2 more sources