Polyhedral graphs via their automorphism groups

Modjtaba Ghorbani and Mahin Songhori

Applied Mathematics and Computation, 2018, vol. 321, issue C, 1-10

Abstract: A polyhedral graph is a three connected simple planar graph. An automorphism of a graph is a bijection on its vertices which preserves the edge set. In this paper, we compute the automorphism group of cubic polyhedral graphs whose faces are triangles, quadrangles, pentagons and hexagons. In continuing, we classify all cubic polyhedral graphs with Cayley graph structure.

Keywords: Polyhedral graph; Cayley graph; Automorphism group; Sylow p-subgroup (search for similar items in EconPapers)
Date: 2018
References: View references in EconPapers View complete reference list from CitEc
Citations:

Downloads: (external link)
http://www.sciencedirect.com/science/article/pii/S0096300317307270
Full text for ScienceDirect subscribers only

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:eee:apmaco:v:321:y:2018:i:c:p:1-10

DOI: 10.1016/j.amc.2017.10.028

Access Statistics for this article

Applied Mathematics and Computation is currently edited by Theodore Simos

More articles in Applied Mathematics and Computation from Elsevier
Bibliographic data for series maintained by Catherine Liu ().