Results 31 to 40 of about 2,418,413 (302)
On a class of metrics related to graph layout problems [PDF]
, 2010 We examine the metrics that arise when a finite set of points is embedded in the real line, in such a way that the distance between each pair of points is at least 1.
Theis, D O +3 more
core +5 more sources
BinSlayer: Accurate Comparison of Binary Executables [PDF]
, 2013 As the volume of malware inexorably rises, comparison of binary code is of increasing importance to security analysts as a method of automatically classifying new malware samples; purportedly new examples of malware are frequently a simple evolution of ...
Martial Bourquin +5 more
core +1 more source
The matching polynomial of a distance-regular graph
International Journal of Mathematics and Mathematical Sciences, 2000 A distance-regular graph of diameter d has 2d intersection numbers that determine many properties of graph (e.g., its spectrum). We show that the first six coefficients of the matching polynomial of a distance-regular graph can also be determined from ...
Robert A. Beezer, E. J. Farrell
doaj +1 more source
Efficient Point-to-Point Resistance Distance Queries in Large Graphs
, 2023 We describe a method to efficiently compute point-to-point resistance distances in a graph, which are notoriously difficult to compute from the raw graph data. Our method is based on a relatively compact hierarchical data structure which “compresses” the
Hormann, Kai +3 more
core +1 more source
Discrete Mathematics, 1992 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire +2 more sources
Distance independence in graphs
Discussiones Mathematicae Graph Theory, 2011 For a set D of positive integers, we define a vertex set SV (G) to be D-independent if u,v 2 S implies the distance d(u,v) 㘲 D. The D-independence numberD(G) is the maximum cardinality of a D-independent set. In particular, the independence number (G) = {1}(G).
J. Louis Sewell, Peter J. Slater
openaire +1 more source
Distances in orientations of graphs
Journal of Combinatorial Theory, Series B, 1978 We prove that there is a function h(k) such that every undirected graph G admits an orientation H with the following property: if an edge uv belongs to a cycle of length k in G, then uv or vu belongs to a directed cycle of length at most h(k) in H. Next, we show that every undirected bridgeless graph of radius r admits an orientation of radius at most $
Vasek Chvátal, Carsten Thomassen
openaire +2 more sources
On the graph of large distances [PDF]
Discrete & Computational Geometry, 1989 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
ON DISTANCE-i-GRAPHS OF DISTANCE-REGULAR GRAPHS
Kyushu Journal of Mathematics, 1994 Let \(G\) be a graph. The distance \(i\)-graph of \(G\) is the graph \(G_ i\) defined on the vertex set of \(G\), and \(u\) and \(v\) are adjacent if and only if the distance between \(u\) and \(v\) is \(i\). This paper studies the distance \(i\)-graph of a distance regular graph and its connected component, and obtains a lot of special features of the
openaire +2 more sources