The l1-Embeddability of Hypertrees and Unicyclic Hypergraphs
Author:
Wang Guangfu,Chen Lijun,Xiong Zhikun
Abstract
A hypercube is a graph whose nodes can be labeled by binary vectors such that the distance between the binary addresses in the graph is the Hamming distance. Due to the symmetry of the hypercube, one usually considers the graph embedded in the hypercube proportionally in distance, meaning that the l1-graphs. In this paper, we determine the l1-embeddability of hypertrees and unicyclic hypergraphs.
Funder
National Natural Science Foundation of China
Natural Science Foundation of Jiangxi Province
Subject
Physics and Astronomy (miscellaneous),General Mathematics,Chemistry (miscellaneous),Computer Science (miscellaneous)
Reference29 articles.
1. Hypergraph motifs
2. Graphes et Hypergraphes;Berge,1970
3. ON THE TWO-COLOURING OF HYPERGRAPHS
4. Hypergraphs, Combinatorics of Finite Sets;Berge,1989
5. On the spectral radii of k-uniform linear hypergraphs;Tang;J. Nat. Sci. Hunan Norm. Univ.,2018
Cited by
2 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献