Premium
On Graphs Without Multicliqual Edges
Author(s) -
ChongKeang Lim,
YeeHock Peng
Publication year - 1981
Publication title -
journal of graph theory
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 1.164
H-Index - 54
eISSN - 1097-0118
pISSN - 0364-9024
DOI - 10.1002/jgt.3190050416
Subject(s) - combinatorics , mathematics , block graph , split graph , cograph , discrete mathematics , clique graph , clique sum , line graph , clique , chordal graph , graph , clique number , simplex graph , pathwidth , voltage graph
An edge which belongs to more than one clique of a given graph is called a multicliqual edge. We find a necessary and sufficient condition for a graph H to be the clique graph of some graph G without multicliqual edges. We also give a characterization of graphs without multicliqual edges that have a unique critical generator. Finally, it is shown that there are infinitely many self‐clique graphs having more than one critical generator.