A note on nearly Platonic graphs with connectivity one

Dalibor Froncek; Mahdi Reza Khorsandi; Seyed Reza Musawi; Jiangyi Qiu

doi:10.5614/ejgta.2021.9.1.17

A note on nearly Platonic graphs with connectivity one

Dalibor Froncek, Mahdi Reza Khorsandi, Seyed Reza Musawi, Jiangyi Qiu

Mathematics & Statistics

Research output: Contribution to journal › Article › peer-review

2 Scopus citations

Abstract

A k-regular planar graph G is nearly Platonic when all faces but one are of the same degree while the remaining face is of a different degree. We show that no such graphs with connectivity one can exist. This complements a recent result by Keith, Froncek, and Kreher on non-existence of 2-connected nearly Platonic graphs.

Original language	English (US)
Pages (from-to)	195-205
Number of pages	11
Journal	Electronic Journal of Graph Theory and Applications
Volume	9
Issue number	1
DOIs	https://doi.org/10.5614/ejgta.2021.9.1.17
State	Published - 2021

Bibliographical note

Publisher Copyright:
© 2021

Keywords

Platonic graph
planar graph
regular graph

Access

10.5614/ejgta.2021.9.1.17

OpenUrl availability

Full text

Cite this

@article{20582b78067b4bdca9df34112344832e,

title = "A note on nearly Platonic graphs with connectivity one",

abstract = "A k-regular planar graph G is nearly Platonic when all faces but one are of the same degree while the remaining face is of a different degree. We show that no such graphs with connectivity one can exist. This complements a recent result by Keith, Froncek, and Kreher on non-existence of 2-connected nearly Platonic graphs.",

keywords = "Platonic graph, planar graph, regular graph",

author = "Dalibor Froncek and Khorsandi, {Mahdi Reza} and Musawi, {Seyed Reza} and Jiangyi Qiu",

note = "Publisher Copyright: {\textcopyright} 2021",

year = "2021",

doi = "10.5614/ejgta.2021.9.1.17",

language = "English (US)",

volume = "9",

pages = "195--205",

journal = "Electronic Journal of Graph Theory and Applications",

issn = "2338-2287",

publisher = "Indonesian Combinatorics Society",

number = "1",

}

TY - JOUR

T1 - A note on nearly Platonic graphs with connectivity one

AU - Froncek, Dalibor

AU - Khorsandi, Mahdi Reza

AU - Musawi, Seyed Reza

AU - Qiu, Jiangyi

PY - 2021

Y1 - 2021

N2 - A k-regular planar graph G is nearly Platonic when all faces but one are of the same degree while the remaining face is of a different degree. We show that no such graphs with connectivity one can exist. This complements a recent result by Keith, Froncek, and Kreher on non-existence of 2-connected nearly Platonic graphs.

AB - A k-regular planar graph G is nearly Platonic when all faces but one are of the same degree while the remaining face is of a different degree. We show that no such graphs with connectivity one can exist. This complements a recent result by Keith, Froncek, and Kreher on non-existence of 2-connected nearly Platonic graphs.

KW - Platonic graph

KW - planar graph

KW - regular graph

UR - http://www.scopus.com/inward/record.url?scp=85106573843&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=85106573843&partnerID=8YFLogxK

U2 - 10.5614/ejgta.2021.9.1.17

DO - 10.5614/ejgta.2021.9.1.17

M3 - Article

AN - SCOPUS:85106573843

SN - 2338-2287

VL - 9

SP - 195

EP - 205

JO - Electronic Journal of Graph Theory and Applications

JF - Electronic Journal of Graph Theory and Applications

IS - 1

ER -

A note on nearly Platonic graphs with connectivity one

Abstract

Bibliographical note

Keywords

Access

OpenUrl availability

Other files and links

Fingerprint

Cite this