Search
Search Results
-
Distances Between Immersed Graphs: Metric Properties
Graphs in metric spaces appear in a wide range of data sets, and there is a large body of work focused on comparing, matching, or analyzing...
-
Resolving Sets in Temporal Graphs
A resolving set R in a graph G is a set of vertices such that every vertex of G is uniquely identified by its distances to the vertices of R....
-
Building Multiple Classifier Systems Using Linear Combinations of Reduced Graphs
Despite great efforts done in research in the last decades, the classification of general graphs, i.e., graphs with unconstrained labeling and...
-
Investigation of Statistics of Nearest Neighbor Graphs
AbstractThis paper describes some statistical properties of the nearest neighbor graphs (NNGs). We study the sample distributions of graphs by the...
-
Turán Problems for Oriented Graphs
A classical Turán problem asks for the maximum possible number of edges in a graph of a given order that does not contain a particular graph H as a...
-
Monitoring Edge-Geodetic Sets in Graphs: Extremal Graphs, Bounds, Complexity
A monitoring edge-geodetic set, or simply an MEG-set, of a graph G is a vertex subset...
-
Activity graphs: Spatial graphs as a framework for quantifying individual mobility
Human mobility is poorly captured by existing methods which employ simple measures to quantify human mobility patterns. This paper develops spatial...
-
Discussion about Properties of First Nearest Neighbor Graphs
AbstractIn this study we present a benchmark of statistical distributions of the first nearest neighbors in random graphs. We consider distribution...
-
Pebbling in Kneser Graphs
Graph pebbling is a game played on graphs with pebbles on their vertices. A pebbling move removes two pebbles from one vertex and places one pebble...
-
Modeling the Nearest Neighbor Graphs to Estimate the Probability of the Independence of Data
AbstractThe proposed method is based on calculations of the statistics of the nearest neighbor graph (NNG) structures, which are presented as a...
-
Minimizing Distances Between Vertices and Edges Through Tree t-Spanners
A tree t-spanner of a graph G is a spanning tree T of G in which any two adjacent vertices of G have distance at most t in T. We say that G is...
-
Combining landscape and genetic graphs to address key issues in landscape genetics
ContextAll the components of landscape and genetic structures can be associated with the nodes and links of landscape graphs and genetic graphs. Yet,...
-
Communicability cosine distance: similarity and symmetry in graphs/networks
A distance based on the exponential kernel of the adjacency matrix of a graph and representing how well two vertices connect to each other in a graph...
-
Distances between Maximal Monotone Operators
We introduce a series of distances between maximal monotone operators and study their properties. As applications, we consider the existence of...
-
On the Distances Within Cliques in a Soft Random Geometric Graph
We study the distances of vertices within cliques in a soft random geometric graph on a torus, where the vertices are points of a homogeneous Poisson...
-
Start thinking in graphs: using graphs to address critical attack paths in a Microsoft cloud tenant
The challenge of securing IT environments has reached a new complexity level as a growing number of organisations adopt cloud solutions. This trend...
-
The density of planar sets avoiding unit distances
By improving upon previous estimates on a problem posed by L. Moser, we prove a conjecture of Erdős that the density of any measurable planar set...
-
Source detection on graphs
Spreading processes on networks (graphs) have become ubiquitous in modern society with prominent examples such as infections, rumors, excitations,...
-
Counting Vertices in Iterated Line Graphs
We introduce new methods of studying properties of iterated line graphs and demonstrate the use of these methods on a class of tree graphs. We also...
-
Closed paths in graphs vs. voting theory
Features of graphs that hinder finding closed paths with particular properties, as represented by the Traveling Salesperson Problem—TSP, are...
