Document Type

Article

Publication Date

7-1-2021

Abstract

Seymour's Second-Neighborhood Conjecture states that every directed graph whose underlying graph is simple has at least one vertex (Formula presented.) such that the number of vertices of out-distance two from (Formula presented.) is at least as large as the number of vertices of out-distance one from it. We present alternative statements of the conjecture in the language of linear algebra.

Publication Source (Journal or Book title)

Journal of Graph Theory

First Page

393

Last Page

400

Download
COinS