Distinguishing classes of intersection graphs of homothets or similarities of two convex disks

08/10/2021
by   Mikkel Abrahamsen, et al.
0

For smooth convex disks A, i.e., convex compact subsets of the plane with non-empty interior, we classify the classes G^hom(A) and G^sim(A) of intersection graphs that can be obtained from homothets and similarities of A, respectively. Namely, we prove that G^hom(A)=G^hom(B) if and only if A and B are affine equivalent, and G^sim(A)=G^sim(B) if and only if A and B are similar.

READ FULL TEXT
research
03/18/2018

Almost all string graphs are intersection graphs of plane convex sets

A string graph is the intersection graph of a family of continuous arcs...
research
02/05/2019

Classifying Convex Bodies by their Contact and Intersection Graphs

Suppose that A is a convex body in the plane and that A_1,...,A_n are tr...
research
01/03/2020

Representing graphs as the intersection of cographs and threshold graphs

A graph G is said to be the intersection of graphs G_1,G_2,...,G_k if V(...
research
10/08/2020

Isometric and affine copies of a set in volumetric Helly results

We show that for any compact convex set K in ℝ^d and any finite family ℱ...
research
05/26/2021

Total, Equitable Total and Neighborhood sum distinguishing Total Colorings of Some Classes of Circulant Graphs

In this paper, we have obtained the total chromatic as well as equitable...
research
09/18/2017

A Novel Approach for Ellipsoidal Outer-Approximation of the Intersection Region of Ellipses in the Plane

In this paper, a novel technique for tight outer-approximation of the in...
research
06/22/2021

Morse-Smale complexes on convex polyhedra

Motivated by applications in geomorphology, the aim of this paper is to ...

Please sign up or login with your details

Forgot password? Click here to reset