Clique roots of K4-free chordal graphs

<p>The clique polynomial <span class="math"><em>C</em>(<em>G</em>, <em>x</em>)</span> of a finite, simple and undirected graph <span class="math"><em>G</em> = (<em>V</em>, <em>E</em>)&...

Full description

Bibliographic Details
Main Author: Hossein Teimoori Faal
Format: Article
Language:English
Published: Indonesian Combinatorial Society (InaCombS); Graph Theory and Applications (GTA) Research Centre; University of Newcastle, Australia; Institut Teknologi Bandung (ITB), Indonesia 2019-04-01
Series:Electronic Journal of Graph Theory and Applications
Subjects:
Online Access:https://www.ejgta.org/index.php/ejgta/article/view/501