论文标题
3对称图
3-Symmetric Graphs
论文作者
论文摘要
随机图的直观属性是其子图也应随机分布。我们考虑其子图密度与预期值完全匹配的图。我们将此属性称为所有子图的图形，$ k $顶点为$ k $ - symmetric。我们讨论了此类图的一些属性和示例。我们构建了3个对称图并提供一些统计数据。
An intuitive property of a random graph is that its subgraphs should also appear randomly distributed. We consider graphs whose subgraph densities exactly match their expected values. We call graphs with this property for all subgraphs with $k$ vertices to be $k$-symmetric. We discuss some properties and examples of such graphs. We construct 3-symmetric graphs and provide some statistics.
