Name
Abstract | ||
|---|---|---|
Connected planar graphs are of interest to a variety of scholars. Being able to simulate a database of such graphs with selected properties would support specific types of inference for spatial analysis and other network-based disciplines. This paper presents a simple, efficient, and flexible connected planar graph generator for this purpose. It also summarizes a comparison between an empirical set of specimen graphs and their simulated counterpart set, and establishes evidence for positing a conjecture about the principal eigenvalue of connected planar graphs. Finally, it summarizes a probability assessment of the algorithm’s outcomes as well as a comparison between the new algorithm and selected existing planar graph generators. |
Year | DOI | Venue |
|---|---|---|
2018 | 10.1007/s10707-018-0328-3 | GeoInformatica |
Keywords | Field | DocType |
Adjacency matrix, Connected graph, Planar graph, Random sampling | Adjacency matrix,Data mining,Discrete mathematics,Graph,Inference,Sampling (statistics),Connectivity,Conjecture,Geography,Eigenvalues and eigenvectors,Planar graph | Journal |
Volume | Issue | ISSN |
22 | 4 | 1384-6175 |
Citations | PageRank | References |
0 | 0.34 | 3 |
Authors | ||
1 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Daniel A. Griffith | 1 | 91 | 23.76 |