Next Article in Journal
DG-GMsFEM for Problems in Perforated Domains with Non-Homogeneous Boundary Conditions
Previous Article in Journal
Density Functional Theory of Highly Excited States of Coulomb Systems
Technical Note

Note on F-Graph Construction

Institute of Applied Informatics, Automation and Mechatronics, Slovak University of Technology in Bratislava, Bottova 25, 917 24 Trnava, Slovakia
*
Author to whom correspondence should be addressed.
Academic Editor: Yudong Zhang
Received: 24 May 2021 / Revised: 21 June 2021 / Accepted: 23 June 2021 / Published: 24 June 2021
The center of an F-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. View Full-Text
Keywords: eccentricity; center of a graph; F-graph eccentricity; center of a graph; F-graph
Show Figures

Figure 1

MDPI and ACS Style

Liska, V.; Vrabel, R. Note on F-Graph Construction. Computation 2021, 9, 74. https://0-doi-org.brum.beds.ac.uk/10.3390/computation9070074

AMA Style

Liska V, Vrabel R. Note on F-Graph Construction. Computation. 2021; 9(7):74. https://0-doi-org.brum.beds.ac.uk/10.3390/computation9070074

Chicago/Turabian Style

Liska, Vladimir, and Robert Vrabel. 2021. "Note on F-Graph Construction" Computation 9, no. 7: 74. https://0-doi-org.brum.beds.ac.uk/10.3390/computation9070074

Find Other Styles
Note that from the first issue of 2016, MDPI journals use article numbers instead of page numbers. See further details here.

Article Access Map by Country/Region

1
Back to TopTop