DeepAI
Log In Sign Up

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

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...
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...
06/20/2020

Cycle-based formulations in Distance Geometry

The distance geometry problem asks to find a realization of a given simp...
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...
10/03/2020

Planar projections of graphs

We introduce and study a new graph representation where vertices are emb...
09/01/2020

Strong Hanani-Tutte for the Torus

If a graph can be drawn on the torus so that every two independent edges...
02/16/2019

Flip distances between graph orientations

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