Results 61 to 70 of about 8,766 (207)
Recognition of Unipolar and Generalised Split Graphs
Algorithms, 2015 A graph is unipolar if it can be partitioned into a clique and a disjoint union of cliques, and a graph is a generalised split graph if it or its complement is unipolar.
Colin McDiarmid, Nikola Yolov
doaj +1 more source
Clique numbers of graph unions
, 2013 Let $B$ and $R$ be two simple graphs with vertex set $V$, and let $G(B,R)$ be the simple graph with vertex set $V$, in which two vertices are adjacent if they are adjacent in at least one of $B$ and $R$. For $X \subseteq V$, we denote by $B|X$ the subgraph of $B$ induced by $X$; let $R|X$ and $G(B,R)|X$ be defined similarly. We say that the pair $(B,R)$
Chudnovsky, Maria, Ziani, Juba
openaire +2 more sources
Extremal digraphs with given clique number
Linear Algebra and its Applications, 2013 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Drury, S. W., Lin, Huiqiu
openaire +1 more source
Sweeping graphs with large clique number
Discrete Mathematics, 2009 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Yang, Boting +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 +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 CombinatoricsThe 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
Using Edge Contractions and Vertex Deletions to Reduce the Independence Number and the Clique Number [PDF]
, 2022 Felicia Lucke, Felix Mann
openalex +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