Uniquely $K_r$-Saturated Graphs

Electronic Journal Of Combinatorics

Stephen G. Hartke¹ 

关键词: uniquely saturated graphs;    Cayley graphs;    orbital branching;    computational combinatorics;   

DOI  :  

学科分类：离散数学和组合数学

来源: Electronic Journal Of Combinatorics

【 摘 要 】

A graph $G$ is uniquely $K_r$-saturated if it contains no clique with $r$ vertices and if for all edges $e$ in the complement, $G+e$ has a unique clique with $r$ vertices. Previously, few examples of uniquely $K_r$-saturated graphs were known, and little

【 授权许可】

Others