2016/12/25 by Yingkai Ouyang, Ouyang, Yingkai
Engineering · Mathematics · #Combinatorics (math.CO) #Discrete Mathematics (cs.DM) #FOS: Computer and information sciences #FOS: Mathematics #Functional Analysis (math.FA) #Graph theory and applications #Mechanical Behavior of Composites
paper · pdf · doi:10.48550/arxiv.1612.08259
openalex publication_date 2016/12/25 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28
The k-th symmetric product of a graph G with vertex set V with edge set E is a graph with vertices as k-sets of V, where two k-sets are connected by an edge if and only if their symmetric difference is an edge in E. Using the isoperimetric properties of the vertex-induced subgraphs of G and Sobolev inequalities on graphs, we obtain various edge-isoperimetric inequalities pertaining to the symmetric product of certain families of finite and infinite graphs.