A property of a particular generalized Petersen unit-distance graph

A generalized Petersen graph is a graph with 2n vertices, where each vertex has degree 3 and there are 3n edges. A unit-distance graph is a graph with every edge of 1 unit length. We study the geometric transformation of a generalized Petersen graph into a generalized Petersen unit-distance graph and the rotation angles of the n-pointed star of the generalized Petersen unit-distance graph. Then, we obtain the properties of the generalized Petersen unit-distance graph and the rotation angles of the n-pointed star of the generalized Petersen unit-distance graph by using geometric transformations, trigonometric functions, and the rule of sine and cosine, along with similar polygons.

Authors

Publication Details

Journal
Mathematical Modeling and Computing
Published
2025-01-01
DOI
https://doi.org/10.23939/mmc2025.02.461
Primary Topic
Structural Analysis and Optimization
Type
article
Field-Weighted Citation Impact
0.00
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

A property of a particular generalized Petersen unit-distance graph

Pinkaew Siriwong, N. Kaenthong, P. Thongnork, P. Thongroek
Mathematical Modeling and Computing
Structural Analysis and Optimization
article

A property of a particular generalized Petersen unit-distance graph

Pinkaew Siriwong, N. Kaenthong, P. Thongnork, P. Thongroek
article en

Abstract

A generalized Petersen graph is a graph with 2n vertices, where each vertex has degree 3 and there are 3n edges. A unit-distance graph is a graph with every edge of 1 unit length. We study the geometric transformation of a generalized Petersen graph into a generalized Petersen unit-distance graph and the rotation angles of the n-pointed star of the generalized Petersen unit-distance graph. Then, we obtain the properties of the generalized Petersen unit-distance graph and the rotation angles of the n-pointed star of the generalized Petersen unit-distance graph by using geometric transformations, trigonometric functions, and the rule of sine and cosine, along with similar polygons.

Mathematical Modeling and ComputingVol. 12(2)
Openalex Percentile: Top 89%
Structural Analysis and Optimization
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.