Geodesic
Spanning tree bounds for grid graphs
Kristopher Tapp1
1Saint Joseph's University
The electronic journal of combinatorics, Tome 31 (2024) no. 1
Cet article a éte moissonné depuis la source The Electronic Journal of Combinatorics website

Voir la notice de l'article

Among subgraphs with a fixed number of vertices of the regular square lattice, we prove inequalities that essentially say that those with smaller boundaries have larger numbers of spanning trees and vice-versa. As an application, we relate two commonly used measurements of the compactness of district maps.
DOI : 10.37236/12130
Classification : 05C05, 05C81, 05C90, 05C70, 91F10
Mots-clés : compactness of district maps, grid graphs, bulk limit

Kristopher Tapp  1

1 Saint Joseph's University 
@article{10_37236_12130,
     author = {Kristopher Tapp},
     title = {Spanning tree bounds for grid graphs},
     journal = {The electronic journal of combinatorics},
     year = {2024},
     volume = {31},
     number = {1},
     doi = {10.37236/12130},
     zbl = {1533.05055},
     url = {http://geodesic.mathdoc.fr/articles/10.37236/12130/}
}
TY  - JOUR
AU  - Kristopher Tapp
TI  - Spanning tree bounds for grid graphs
JO  - The electronic journal of combinatorics
PY  - 2024
VL  - 31
IS  - 1
UR  - http://geodesic.mathdoc.fr/articles/10.37236/12130/
DO  - 10.37236/12130
ID  - 10_37236_12130
ER  - 
%0 Journal Article
%A Kristopher Tapp
%T Spanning tree bounds for grid graphs
%J The electronic journal of combinatorics
%D 2024
%V 31
%N 1
%U http://geodesic.mathdoc.fr/articles/10.37236/12130/
%R 10.37236/12130
%F 10_37236_12130
Kristopher Tapp. Spanning tree bounds for grid graphs. The electronic journal of combinatorics, Tome 31 (2024) no. 1. doi: 10.37236/12130

Cité par Sources :