Results 21 to 30 of about 118,378,802 (306)
On the graph of large distances [PDF]
Let \(S\) be a set of \(n\) points in the plane and let \(d_1>d_2>..\). be the different distances determined by the set \(S\). The graph \(G(S,k)\) is considered whose vertex set is S and in which two vertices are adjacent if and only if their distance is at least \(k\). The chromatic number \(\chi(G(S,k))\) of \(G(S,k)\) is studied. It is proved that
Erdös, P. +2 more
openaire +1 more source
Revisiting Volgenant-Jonker for Approximating Graph Edit Distance [PDF]
Although it is agreed that the Volgenant-Jonker (VJ) algorithm provides a fast way to approximate graph edit distance (GED), until now nobody has reported how the VJ algorithm can be tuned for this task.
Andy King +5 more
core +1 more source
Distance-unbalancedness of graphs [PDF]
14 pages, 3 ...
Miklavič, Štefko, Šparl, Primož
openaire +2 more sources
Open Distance-Pattern Uniform Graphs [PDF]
All graphs considered in this paper are finite, simple, undirected and connected. For graph theoretic terminology we refer to Harary [6].
Jose, Bibin K.
core +1 more source
A graph , where and is said to be a distance magic graph if there exists a bijection from the vertex set to the set such that, , for all , which is a constant and independent of , where is the open neighborhood of the vertex .
Aloysius Godinho, T. Singh
doaj +2 more sources
The distance seidel spectrum of some graph operations [PDF]
The distance matrix, distance eigenvalue, and distance energy of a connected graph have been studied in detail in literature where as the study on distance seidel matrix associated with a connected graph is in progress. The eigenvalues ∂1S≥∂2S≥ ...
Deena Scaria, Indulal Gopal
doaj +1 more source
Metrics for graph comparison: A practitioner's guide.
Comparison of graph structure is a ubiquitous task in data analysis and machine learning, with diverse applications in fields such as neuroscience, cyber security, social network analysis, and bioinformatics, among others.
Peter Wills, François G Meyer
doaj +1 more source
Graph edit distance or graph edit pseudo-distance? [PDF]
Graph Edit Distance has been intensively used since its appearance in 1983. This distance is very appropriate if we want to compare a pair of attributed graphs from any domain and obtain not only a distance, but also the best correspondence between nodes
Serratosa, Francesc +5 more
core +1 more source
The distance spectrum of corona and cluster of two graphs
Let G be a connected graph with a distance matrix D. The D-eigenvalues {μ1,μ2,…,…,μp} of G are the eigenvalues of D and form the distance spectrum or D-spectrum of G.
G. Indulal, Dragan Stevanović
doaj +1 more source

