Transformations of Rectangular Dualizable Graphs

MaRDI QIDQ6357951zbMATH OpenFDO

Authors Krishnendra Shekhawat, Vinod Kumar

Publication date 10 January 2021

Abstract: A plane graph is said to be a rectangular graph if each of its edges can be oriented horizontal or vertical, its internal regions are four-sided and it has a rectangular enclosure. If dual of a planar graph is a rectangular graph, then the graph is said to be a rectangular dualizable graph (RDG). In this paper, we present adjacency transformations between RDGs and present polynomial time algorithms for their transformations. An RDG $mathcalG=(V,E)$ is called maximal RDG (MRDG) if there does not exist an RDG $mathcal{G}^{\prime }=(V,E^{\prime })$ with $E^{\prime }supsetE$. An RDG $mathcalG=(V,E)$ is said to be an edge-reducible if there exists an RDG $mathcal{G}^{\prime }=(V,E^{\prime })$ such that $Esupset{E}^{\prime }$. If an RDG is not edge-reducible, it is said to be an edge-irreducible RDG. We show that there always exists an MRDG for a given RDG. We also show that an MRDG is edge-reducible and can always be transformed to a minimal one (an edge-irreducible RDG).

This page was built for publication: Transformations of Rectangular Dualizable Graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6357951)