On families of 2-nearly Platonic graphs

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

doi:10.5614/ejgta.2022.10.2.23

On families of 2-nearly Platonic graphs

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

Mathematics & Statistics

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

Abstract

A 2-nearly Platonic graph of type (k|d) is a k-regular planar graph with f faces, f − 2 of which are of size d and the remaining two are of sizes d₁, d₂, both different from d. Such a graph is called balanced if d₁ = d₂. We show that all connected 2-nearly Platonic graphs are necessarily balanced. This proves a recent conjecture by Keith, Froncek, and Kreher.

Original language	English (US)
Pages (from-to)	659-684
Number of pages	26
Journal	Electronic Journal of Graph Theory and Applications
Volume	10
Issue number	2
DOIs	https://doi.org/10.5614/ejgta.2022.10.2.23
State	Published - 2022

Bibliographical note

Publisher Copyright:
© 2022, Electronic Journal of Graph Theory and Applications. All Rights Reserved.

Keywords

Planar graphs
Platonic graphs
Regular graphs

Publisher link

10.5614/ejgta.2022.10.2.23

Find It

Find It at U of M Libraries

Cite this

@article{5b65200b0f804e5d83b54a4e861d9ac8,

title = "On families of 2-nearly Platonic graphs",

abstract = "A 2-nearly Platonic graph of type (k|d) is a k-regular planar graph with f faces, f − 2 of which are of size d and the remaining two are of sizes d1, d2, both different from d. Such a graph is called balanced if d1 = d2. We show that all connected 2-nearly Platonic graphs are necessarily balanced. This proves a recent conjecture by Keith, Froncek, and Kreher.",

keywords = "Planar graphs, Platonic graphs, Regular graphs",

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

year = "2022",

doi = "10.5614/ejgta.2022.10.2.23",

language = "English (US)",

volume = "10",

pages = "659--684",

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

issn = "2338-2287",

publisher = "Indonesian Combinatorics Society",

number = "2",

}

TY - JOUR

T1 - On families of 2-nearly Platonic graphs

AU - Froncek, Dalibor

AU - Khorsandi, Mahdi Reza

AU - Musawi, Seyed Reza

AU - Qiu, Jiangyi

PY - 2022

Y1 - 2022

N2 - A 2-nearly Platonic graph of type (k|d) is a k-regular planar graph with f faces, f − 2 of which are of size d and the remaining two are of sizes d1, d2, both different from d. Such a graph is called balanced if d1 = d2. We show that all connected 2-nearly Platonic graphs are necessarily balanced. This proves a recent conjecture by Keith, Froncek, and Kreher.

AB - A 2-nearly Platonic graph of type (k|d) is a k-regular planar graph with f faces, f − 2 of which are of size d and the remaining two are of sizes d1, d2, both different from d. Such a graph is called balanced if d1 = d2. We show that all connected 2-nearly Platonic graphs are necessarily balanced. This proves a recent conjecture by Keith, Froncek, and Kreher.

KW - Planar graphs

KW - Platonic graphs

KW - Regular graphs

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

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

U2 - 10.5614/ejgta.2022.10.2.23

DO - 10.5614/ejgta.2022.10.2.23

M3 - Article

AN - SCOPUS:85141799284

SN - 2338-2287

VL - 10

SP - 659

EP - 684

JO - Electronic Journal of Graph Theory and Applications

JF - Electronic Journal of Graph Theory and Applications

IS - 2

ER -

On families of 2-nearly Platonic graphs

Abstract

Bibliographical note

Keywords

Publisher link

Find It

Other files and links

Fingerprint

Cite this