The Structure of Graphs Whose Vertices of Degree at Least Three Are at a Distance of at Least Three
Abstract
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.
Fields of Study & Subjects
Advanced Graph Theory Research
Graph theory and applications
Graph Labeling and Dimension Problems
Publication details
- Journal / source
- Mathematics
- Volume
- 14
- Issue
- 4
- Pages
- 637–637
- Publication date
- 11 February 2026
- Language
- EN