Spanning trees in subgraphs of lattices

Shing-Tung Yau ST Yau

Combinatorics mathscidoc:1912.43640

Contemporary Mathematics, 245, 201-220, 1999
In a graph G, for a subset S of the vertex set, the induced subgraph determined by S has edge set consisting of all edges of G with both endpoints in S. The (edge) boundary, denoted by S consists of all edges containing one endpoint in S and one endpoint not in S.
No keywords uploaded!
[ Download ] [ 2019-12-24 20:46:52 uploaded by yaust ] [ 281 downloads ] [ 0 comments ]
@inproceedings{shing-tung1999spanning,
  title={Spanning trees in subgraphs of lattices},
  author={Shing-Tung Yau, and ST Yau},
  url={http://archive.ymsc.tsinghua.edu.cn/pacm_paperurl/20191224204652410716204},
  booktitle={Contemporary Mathematics},
  volume={245},
  pages={201-220},
  year={1999},
}
Shing-Tung Yau, and ST Yau. Spanning trees in subgraphs of lattices. 1999. Vol. 245. In Contemporary Mathematics. pp.201-220. http://archive.ymsc.tsinghua.edu.cn/pacm_paperurl/20191224204652410716204.
Please log in for comment!
 
 
Contact us: office-iccm@tsinghua.edu.cn | Copyright Reserved