The Structure of Graphs Whose Vertices of Degree at Least Three Are at a Distance of at Least Three
Let G be a connected graph in which the distance between any two distinct vertices of degree of at least three is at least three. We find the structure of G. It turns out that G decomposes into a tree and a matching.
Authors
- Steve Karam (ORCID: https://orcid.org/0000-0001-8248-2872)
- Salman Ghazal (ORCID: https://orcid.org/0000-0003-3845-1280)
Institutions
- American University of the Middle East (KW)
Publication Details
- Journal
- Mathematics
- Published
- 2026-02-11
- DOI
- https://doi.org/10.3390/math14040637
- Primary Topic
- Graph theory and applications
- Type
- article
- Field-Weighted Citation Impact
- 0.00