Note on <i>F</i>-Graph Construction
The center of an <i>F</i>-graph contains at least two vertices, and the distance between any two central vertices is equal to the radius. In this short note, we describe one way of constructing these graphs.
Main Authors: | Vladimir Liska, Robert Vrabel |
---|---|
Format: | Article |
Language: | English |
Published: |
MDPI AG
2021-06-01
|
Series: | Computation |
Subjects: | |
Online Access: | https://www.mdpi.com/2079-3197/9/7/74 |
Similar Items
-
The eccentricity spread of weak-friendship graphs
by: Xuanshi Jia, et al.
Published: (2023-08-01) -
sc-graphs
by: K Periasamy, et al.
Published: (2023-12-01) -
On the Solvability of the Discrete <i>s</i>(<i>x</i>,·)-Laplacian Problems on Simple, Connected, Undirected, Weighted, and Finite Graphs
by: Filip Pietrusiak, et al.
Published: (2022-09-01) -
Eccentric connectivity index in transformation graph Gxy+
by: Aytaç Aysun, et al.
Published: (2023-08-01) -
The Eccentric-Distance Sum Polynomials of Graphs by Using Graph Products
by: Alaa Altassan, et al.
Published: (2022-08-01)