Classification of polyhedral graphs by numbers of common neighbours
Discrete Applied Mathematics · 2027-01 · 396 · 109-127
DOI: 10.1016/j.dam.2026.08.026 ↗Kurz gefasst
Fachartikel in der Zeitschrift Discrete Applied Mathematics, 2027-01. Verfasst von Riccardo W. Maffucci. Die Arbeit nennt 17 Literaturangaben.
Abstract (Originalsprache)
We propose a classification of polyhedra (planar, $3$-connected graphs) according to their type i.e., their set of quantities of common neighbours for each pair of distinct vertices. For every (finite) set of non-negative integers, we either classify all the polyhedra of that type, or construct infinitely many polyhedra of that type, or prove that none exist. This problem is related to the theory of strongly regular and Deza graphs, distances in graphs, and degree sequences. There is potential for application to complex networks and data science.
Zitieren
APA
Maffucci, R. W. (2027). Classification of polyhedral graphs by numbers of common neighbours. Discrete Applied Mathematics, 396, 109-127. https://doi.org/10.1016/j.dam.2026.08.026
Vancouver
Maffucci RW. Classification of polyhedral graphs by numbers of common neighbours. Discrete Applied Mathematics. 2027;396:109-127. doi:10.1016/j.dam.2026.08.026
BibTeX
@article{Maffucci2027,
author = {Maffucci, Riccardo W.},
title = {Classification of polyhedral graphs by numbers of common neighbours},
journal = {Discrete Applied Mathematics},
year = {2027},
volume = {396},
pages = {109--127},
doi = {10.1016/j.dam.2026.08.026}
}
EUVIMED