Classification of nr-graphs
Date
Authors
Advisor
Publisher
Polytechnic University of Puerto Rico
Item Type
Article
- Total Views Total Views2
- Total Downloads Total Downloads6
Abstract
When all possible r-gons are inscribed in an n-gon, the resulting n-graph falls into one of the following three categories: s-regular (sr or strongly regular), //-regular, or regular (k-regular). The definitions and necessary conditions to find the parameters, including the study of such graphs in terms of completeness, are developed throughout the work.
Description
Volumen 7, Número1, Junio 1997
Keywords
Citation
Sarmiento, J. (1997). Classification of nr-graphs, Revista de la Universidad Politécnica de Puerto Rico, 7(1), 95-104.