scholarly journals Blockers for Noncrossing Spanning Trees in Complete Geometric Graphs

2012 ◽  
pp. 383-397 ◽  
Author(s):  
Chaya Keller ◽  
Micha A. Perles ◽  
Eduardo Rivera-Campo ◽  
Virginia Urrutia-Galicia
Keyword(s):  
Spanning Trees ◽  
Geometric Graphs

Computing Minimum Dilation Spanning Trees in Geometric Graphs

2015 ◽  
pp. 297-309
Author(s):  
Aléx F. Brandt ◽  
Miguel F. A. de Gaiowski ◽  
Pedro J. de Rezende ◽  
Cid C. de Souza
Keyword(s):  
Spanning Trees ◽  
Geometric Graphs ◽  
Minimum Dilation

scholarly journals Spanning Trees in Multipartite Geometric Graphs

Algorithmica ◽  
2017 ◽  
Vol 80 (11) ◽  
pp. 3177-3191 ◽  
Author(s):  
Ahmad Biniaz ◽  
Prosenjit Bose ◽  
David Eppstein ◽  
Anil Maheshwari ◽  
Pat Morin ◽  
...  
Keyword(s):  
Spanning Trees ◽  
Geometric Graphs ◽  
Multipartite Geometric Graphs

scholarly journals Packing plane spanning trees and paths in complete geometric graphs

2017 ◽  
Vol 124 ◽  
pp. 35-41 ◽  
Author(s):  
Oswin Aichholzer ◽  
Thomas Hackl ◽  
Matias Korman ◽  
Marc van Kreveld ◽  
Maarten Löffler ◽  
...  
Keyword(s):  
Spanning Trees ◽  
Geometric Graphs

scholarly journals A sufficient condition for the existence of plane spanning trees on geometric graphs

2013 ◽  
Vol 46 (1) ◽  
pp. 1-6 ◽  
Author(s):  
Eduardo Rivera-Campo ◽  
Virginia Urrutia-Galicia
Keyword(s):  
Spanning Trees ◽  
Sufficient Condition ◽  
Geometric Graphs

Optimal ventcel graphs, minimal cost spanning trees and asymptotic probabilities

2007 ◽  
Vol 1 (1) ◽  
pp. 265-275 ◽  
Author(s):  
Chiang Tzuu-Shuh ◽  
Chow Yunshyong
Keyword(s):  
Spanning Trees ◽  
Minimal Cost

scholarly journals Normalized Sombor Indices as Complexity Measures of Random Networks

Entropy ◽  
2021 ◽  
Vol 23 (8) ◽  
pp. 976
Author(s):  
R. Aguilar-Sánchez ◽  
J. Méndez-Bermúdez ◽  
José Rodríguez ◽  
José Sigarreta
Keyword(s):  
Random Matrix ◽  
Adjacency Matrix ◽  
Matrix Theory ◽  
Computational Study ◽  
Random Networks ◽  
Geometric Graphs ◽  
Theory Approach ◽  
Complexity Measures ◽  
Random Geometric Graphs ◽  
Highly Correlated

We perform a detailed computational study of the recently introduced Sombor indices on random networks. Specifically, we apply Sombor indices on three models of random networks: Erdös-Rényi networks, random geometric graphs, and bipartite random networks. Within a statistical random matrix theory approach, we show that the average values of Sombor indices, normalized to the order of the network, scale with the average degree. Moreover, we discuss the application of average Sombor indices as complexity measures of random networks and, as a consequence, we show that selected normalized Sombor indices are highly correlated with the Shannon entropy of the eigenvectors of the adjacency matrix.

scholarly journals Geometric graphs from data to aid classification tasks with Graph Convolutional Networks

Patterns ◽  
2021 ◽  
Vol 2 (4) ◽  
pp. 100237
Author(s):  
Yifan Qian ◽  
Paul Expert ◽  
Pietro Panzarasa ◽  
Mauricio Barahona
Keyword(s):  
Geometric Graphs ◽  
Convolutional Networks ◽  
Classification Tasks
Sign in / Sign up

Export Citation Format

Share Document