Every Graph Is an Integral Distance Graph in the Plane
Copyright policy )Every Graph Is an Integral Distance Graph in the Plane
For a finite subset of the plane the pairs of points for which their euclidean distance is an integer defines the corresponding integral distance graph. It is shown that every finite simple graph may be represented in such a way.
euclidean plane, Distance in graphs, Elementary problems in Euclidean geometries, Computational Theory and Mathematics, Discrete Mathematics and Combinatorics, integral distance graph oscillators, Planar graphs; geometric and topological aspects of graph theory, Theoretical Computer Science
euclidean plane, Distance in graphs, Elementary problems in Euclidean geometries, Computational Theory and Mathematics, Discrete Mathematics and Combinatorics, integral distance graph oscillators, Planar graphs; geometric and topological aspects of graph theory, Theoretical Computer Science
citations This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).5 popularity This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network.Average influence This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).Top 10% impulse This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network.Average
Citations provided by BIP!Popularity provided by BIP!