Search
Close this search box.

Contents

Journal of Combinatorial Mathematics and Combinatorial Computing

  • Research article

Degree Sets in Polygon Visibility Graphs

Jay S. Baca1, J. Michael Mcgrew1, Frank W.Owens1, Joun W. Emert2
1Department of Computer Science Ball State University Muncie, Indiana 47306, USA
2Department of Mathematical Sciences Ball State University Muncie, Indiana 47306, US
  • Published: 31/05/2009

Abstract

This paper presents some new results on permissible degree sets in polygon visibility graphs (PVGs). If the PVG has \( n \) vertices, we say it is an \( n \)-PVG. We also show some canonical construction techniques for PVGs with given degree sets.

Keywords: Visibility graph, polygon visibility graph, degree sequence, degree set, regular graph. 2000 Mathematics Subject Classification: 050
Information
Guidelines
CP Initiatives
Follow CP
Facebook X-twitter Linkedin
1970-2024 CP (Manitoba, Canada) unless otherwise stated.
Citation
Jay S. Baca, J. Michael Mcgrew, Frank W.Owens, Joun W. Emert. Degree Sets in Polygon Visibility Graphs[J], Journal of Combinatorial Mathematics and Combinatorial Computing, Volume 069. 63-74. DOI: .