Odd wheels are not odd-distance graphs

08/24/2020
by   Gábor Damásdi, et al.
0

An odd wheel graph is a graph formed by connecting a new vertex to all vertices of an odd cycle. We answer a question of Rosenfeld and Le by showing that odd wheels cannot be drawn in the plane such that the lengths of the edges are odd integers.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
05/07/2019

Graphs with the second and third maximum Wiener index over the 2-vertex connected graphs

Wiener index, defined as the sum of distances between all unordered pair...
research
09/20/2022

A tight bound for the number of edges of matchstick graphs

A matchstick graph is a plane graph with edges drawn as unit-distance li...
research
03/25/2020

On the Classification of Motions of Paradoxically Movable Graphs

Edge lengths of a graph are called flexible if there exist infinitely ma...
research
06/20/2020

Cycle-based formulations in Distance Geometry

The distance geometry problem asks to find a realization of a given simp...
research
06/05/2023

On the Complexity of Lombardi Graph Drawing

In a Lombardi drawing of a graph the vertices are drawn as points and th...
research
04/03/2020

Wheel-free graphs with no induced five-vertex path

A 4-wheel is the graph consisting of a chordless cycle on four vertices ...
research
02/16/2019

Flip distances between graph orientations

Flip graphs are a ubiquitous class of graphs, which encode relations ind...

Please sign up or login with your details

Forgot password? Click here to reset