Maxclique and Unit Disk Characterizations of Strongly Chordal Graphs

Abstract

Maxcliques (maximal complete subgraphs) and unit disks (closed neighborhoods of vertices) sometime play almost interchangeable roles in graph theory. For instance, interchanging them makes two existing characterizations of chordal graphs into two new characterizations. More intriguingly, these characterizations of chordal graphs can be naturally strengthened to new characterizations of strongly chordal graphs

Keywords

• chordal graph
• strongly chordal graph
• clique
• maxclique
• closed neighborhood