On Clique Roots of Flat Graphs

12/17/2021
by   Hossein Teimoori Faal, et al.
0

A complete subgraph of a given graph is called a clique. A clique Polynomial of a graph is a generating function of the number of cliques in G. A real root of the clique polynomial of a graph G is called a clique root of G. Hajiabolhassan and Mehrabadi showed that the clique polynomial of any simple graph has a clique root in [-1,0). As a generalization of their result, the author of this paper showed that the class of K_4-free connected chordal graphs has also only clique roots. A given graph G is called flat if each edge of G belongs to at most two triangles of G. In answering the author's open question about the class of non-chordal graphs with the same property of having only c;ique roots, we extend the aforementioned result to the class of K_4-free flat graphs. In particular, we prove that the class of K_4-free flat graphs without isolated edges has r=-1 as one of its clique roots. We finally present some interesting open questions and conjectures regarding clique roots of graphs.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
08/06/2022

Expanded-clique graphs and the domination problem

Given a graph G and a function f : V(G) →ℕ such that f(v_i) ≥ d(v_i) for...
research
08/16/2023

On graphs with no induced P_5 or K_5-e

In this paper, we are interested in some problems related to chromatic n...
research
01/07/2018

Perfect graphs with polynomially computable kernels

In a directed graph, a kernel is a subset of vertices that is both stabl...
research
10/19/2018

Local cliques in ER-perturbed random geometric graphs

Random graphs are mathematical models that have applications in a wide r...
research
05/21/2018

Colouring Square-Free Graphs without Long Induced Paths

The complexity of Colouring is fully understood for H-free graphs, but ...
research
03/07/2020

Clustering powers of sparse graphs

We prove that if G is a sparse graph — it belongs to a fixed class of bo...
research
07/20/2023

The clique graphs of the hexagonal lattice – an explicit construction and a short proof of divergence

We present a new, explicit and very geometric construction for the itera...

Please sign up or login with your details

Forgot password? Click here to reset