A degree condition for diameter two orientability of graphs

Éva Czabarka; Peter Dankelmann; László A. Székely

doi:10.1016/j.disc.2018.12.012

A degree condition for diameter two orientability of graphs

Éva Czabarka, Peter Dankelmann, László A. Székely

Mathematics and Applied Mathematics

Research output: Contribution to journal › Article › peer-review

4 Citations (Scopus)

Abstract

For n∈N let δ_n be the smallest value such that every graph of order n and minimum degree at least δ_n admits an orientation of diameter two. We show that δ_n=[Formula presented]+Θ(lnn).

Original language	English
Pages (from-to)	1063-1065
Number of pages	3
Journal	Discrete Mathematics
Volume	342
Issue number	4
DOIs	https://doi.org/10.1016/j.disc.2018.12.012
Publication status	Published - Apr 2019

Keywords

Diameter
Distance
Minimum degree
Orientation
Oriented diameter

ASJC Scopus subject areas

Theoretical Computer Science
Discrete Mathematics and Combinatorics

Access to Document

10.1016/j.disc.2018.12.012

Cite this

@article{e06da47268f646d8b8462305a50909bc,

title = "A degree condition for diameter two orientability of graphs",

abstract = "For n∈N let δn be the smallest value such that every graph of order n and minimum degree at least δn admits an orientation of diameter two. We show that δn=[Formula presented]+Θ(lnn).",

keywords = "Diameter, Distance, Minimum degree, Orientation, Oriented diameter",

author = "{\'E}va Czabarka and Peter Dankelmann and Sz{\'e}kely, {L{\'a}szl{\'o} A.}",

note = "Publisher Copyright: {\textcopyright} 2018 Elsevier B.V.",

year = "2019",

month = apr,

doi = "10.1016/j.disc.2018.12.012",

language = "English",

volume = "342",

pages = "1063--1065",

journal = "Discrete Mathematics",

issn = "0012-365X",

publisher = "Elsevier B.V.",

number = "4",

}

TY - JOUR

T1 - A degree condition for diameter two orientability of graphs

AU - Czabarka, Éva

AU - Dankelmann, Peter

AU - Székely, László A.

PY - 2019/4

Y1 - 2019/4

N2 - For n∈N let δn be the smallest value such that every graph of order n and minimum degree at least δn admits an orientation of diameter two. We show that δn=[Formula presented]+Θ(lnn).

AB - For n∈N let δn be the smallest value such that every graph of order n and minimum degree at least δn admits an orientation of diameter two. We show that δn=[Formula presented]+Θ(lnn).

KW - Diameter

KW - Distance

KW - Minimum degree

KW - Orientation

KW - Oriented diameter

UR - http://www.scopus.com/inward/record.url?scp=85059449917&partnerID=8YFLogxK

U2 - 10.1016/j.disc.2018.12.012

DO - 10.1016/j.disc.2018.12.012

M3 - Article

AN - SCOPUS:85059449917

SN - 0012-365X

VL - 342

SP - 1063

EP - 1065

JO - Discrete Mathematics

JF - Discrete Mathematics

IS - 4

ER -

A degree condition for diameter two orientability of graphs

Abstract

Keywords

ASJC Scopus subject areas

Access to Document

Other files and links

Fingerprint

Cite this