Minimal oriented graphs of diameter 2
type: Item
instance of: scholarly article
title: Minimal oriented graphs of diameter 2
zbMATH Open document ID: 0917.05033
author: Peter Horák
author: C. M. Pareek
author: Xuding Zhu
author: Zoltán Füredi
published in: Graphs and Combinatorics
publication date: 1999-08-02T00:00:00Z
review text: Let \(f(n)\) be the minimum number of arcs among oriented graphs of order \(n\) and diameter 2. The authors show that \((1-o(1))n\log n\leq f(n)\leq n\log n-(3/2)n\) for \(n>8\).
Mathematics Subject Classification ID: 05C20
Mathematics Subject Classification ID: 05C35
Mathematics Subject Classification ID: 05D99
Mathematics Subject Classification ID: 05C15
zbMATH DE Number: 1234338
zbMATH Keywords: oriented graphs
zbMATH Keywords: diameter
MaRDI profile type: Publication
full work available at URL: s003730050022
OpenAlex ID: W1971489728
DOI: 10.1007/S003730050022
description: scientific article; zbMATH DE number 1234338