Abstract
Some combinatorial properties of two planar Euclidean proximity graphs, the relatively closest graph and the modified Gabriel graph, are derived. Similar properties are already known for related graphs—the relative neighborhood graph and the Gabriel graph. We also compare analogous properties of several proximity graphs.
Full Text 
Sign-in/Register to access full text options
Sign-in/Register to access full text options 
Published version (
Free)
Free) 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
