Related papers: On Clique Roots of Flat Graphs
The ordinary generating function of the number of complete subgraphs of $G$ is called a clique polynomial of $G$ and is denoted by $C(G,x)$. A real root of $C(G,x)$ is called a clique root of the graph $G$. Hajiabolhasan and Mehrabadi…
A set $X$ of vertices of a graph $G$ is called a {\em clique cut} of $G$ if the subgraph of $G$ induced by $X$ is a complete graph and the number of connected components of $G-X$ is greater than that of $G$. A clique cut $X$ of $G$ is…
A graph is $H$-free if it has no induced subgraph isomorphic to $H$. Brandst\"adt, Engelfriet, Le and Lozin proved that the class of chordal graphs with independence number at most 3 has unbounded clique-width. Brandst\"adt, Le and Mosca…
The clique complex of a graph G is a simplicial complex whose simplices are all the cliques of G, and the line graph L(G) of G is a graph whose vertices are the edges of G and the edges of L(G) are incident edges of G. In this article, we…
Motivated by an application in condensed matter physics and quantum information theory, we prove that every non-null even-hole-free claw-free graph has a simplicial clique, that is, a clique $K$ such that for every vertex $v \in K$, the set…
The smallest number of cliques, covering all edges of a graph $ G $, is called the (edge) clique cover number of $ G $ and is denoted by $ cc(G) $. It is an easy observation that for every line graph $ G $ with $ n $ vertices, $cc(G)\leq n…
The ordinary generating function of the number of complete subgraphs (cliques) of $G$, denoted by $C(G,x)$, is called the The clique polynomial of the graph $G$. In this paper, we first introduce some \emph{clique} incidence matrices…
A graph is $H$-free if it has no induced subgraph isomorphic to $H$. We continue a study into the boundedness of clique-width of subclasses of perfect graphs. We identify five new classes of $H$-free split graphs whose clique-width is…
Given a root system $R$, two roots are said to be \emph{strongly orthogonal} if neither their sum nor difference is a root. Gashi defined a family of graphs with vertices labelled by sums of $k$-element strongly orthogonal subsets of roots,…
Let $G$ be a graph and $\mathcal{K}_G$ be the set of all cliques of $G$, then the clique graph of G denoted by $K(G)$ is the graph with vertex set $\mathcal{K}_G$ and two elements $Q_i,Q_j \in \mathcal{K}_G$ form an edge if and only if $Q_i…
A {\em hole} in a graph is an induced subgraph which is a cycle of length at least four. A hole is called {\em even} if it has an even number of vertices. An {\em even-hole-free} graph is a graph with no even holes. A vertex of a graph is…
Many NP-complete graph problems are polynomial-time solvable on graph classes of bounded clique-width. Several of these problems are polynomial-time solvable on a hereditary graph class ${\cal G}$ if they are so on the atoms (graphs with no…
A complete subgraph of any simple graph $G$ on $k$ vertices is called a $k$-\emph{clique} of $G$. In this paper, we first introduce the concept of the value of a $k$-clique ($k>1$) as an extension of the idea of the degree of a given…
In this note, we show that a complete $k$-partite graph is the only graph with clique number $k$ among all degree-equivalent simple graphs. This result gives a lower bound on the clique number, which is sharper than existing bounds on a…
Clique-width is a well-studied graph parameter. For graphs of bounded clique-width, many problems that are NP-hard in general can be polynomial-time solvable. The fact motivates several studies to investigate whether the clique-width of…
A graph K is square-free if it contains no four-cycle as a subgraph. A graph K is multiplicative if GxH -> K implies G -> K or H -> K, for all graphs G,H. Here GxH is the tensor (or categorical) graph product and G -> K denotes the…
If a graph has no induced subgraph isomorphic to any graph in a finite family $\{H_1,\ldots,H_p\}$, it is said to be $(H_1,\ldots,H_p)$-free. The class of $H$-free graphs has bounded clique-width if and only if $H$ is an induced subgraph of…
Daligault, Rao and Thomass\'e asked whether every hereditary graph class that is well-quasi-ordered by the induced subgraph relation has bounded clique-width. Lozin, Razgon and Zamaraev (JCTB 2017+) gave a negative answer to this question,…
Clique-width is an important graph parameter due to its algorithmic and structural properties. A graph class is hereditary if it can be characterized by a (not necessarily finite) set ${\cal H}$ of forbidden induced subgraphs. We initiate a…
A \emph{clique} is a set of pairwise adjacent vertices in a graph. We determine the maximum number of cliques in a graph for the following graph classes: (1) graphs with $n$ vertices and $m$ edges; (2) graphs with $n$ vertices, $m$ edges,…