Note on <i>F</i>-Graph Construction

Vladimir Liska; Robert Vrabel

doi:10.3390/computation9070074

Computation (Jun 2021)

Note on <i>F</i>-Graph Construction

Vladimir Liska,
Robert Vrabel

Affiliations

Vladimir Liska: Institute of Applied Informatics, Automation and Mechatronics, Slovak University of Technology in Bratislava, Bottova 25, 917 24 Trnava, Slovakia
Robert Vrabel: Institute of Applied Informatics, Automation and Mechatronics, Slovak University of Technology in Bratislava, Bottova 25, 917 24 Trnava, Slovakia

DOI: https://doi.org/10.3390/computation9070074
Journal volume & issue: Vol. 9, no. 7
p. 74

Abstract

Read online

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.

Published in Computation

ISSN: 2079-3197 (Online)
Publisher: MDPI AG
Country of publisher: Switzerland
LCC subjects: Science: Mathematics: Instruments and machines: Electronic computers. Computer science
Website: http://www.mdpi.com/journal/computation

About the journal

Abstract

Keywords