Data Highway Plus/DH485 overview

Mackay, Steve; Wright, Edwin; Reynders, Deon; Park, John

doi:10.1016/b978-075065807-2/50033-9

Search citation statements

Order By: Relevance

Paper Sections

Select...

Interlacing1

Citation Types

Supporting

Mentioning

Contrasting

Year Published

2017

Publication Types

Select...

Article1

Relationship

Self Cite0

Independent1

Authors

Journals

Cited by 1 publication

(1 citation statement)

References 0 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Also, by applying Corollary 4.4 to doubly regular tournaments, we have the following. In Table 2, we computed the maximum size of transitive subtournaments in a known doubly regular tournament with v vertices for small v. In the row of "maximum", we found a doubly regular tournament with a transitive subtournament having the indicated number of vertices in known doubly regular tournaments given in [9]. Here, the upper bound s ≤ 6 for v = 23 is obtained by Corollary 4.5.…”

Section: Interlacingmentioning

confidence: 99%

Upper bounds on the size of transitive subtournaments in digraphs

Momihara

Suda

2017

Linear Algebra and its Applications

View full text Add to dashboard Cite

In this paper, we consider upper bounds on the size of transitive subtournaments in a digraph. In particular, we give an analogy of Hoffman's bound for the size of cocliques in a regular graph. Furthermore, we partially improve the Hoffman type bound for doubly regular tournaments by using the technique of Greaves and Soicher for strongly regular graphs [4], which gives a new application of block intersection polynomials.In this paper, we consider analogies of the Hoffman bound and the Greaves-Soicher bound to digraphs. In particular, as an analogy of the Hoffman bound for regular graphs, we show that if a

show abstract

Section: Interlacingmentioning

confidence: 99%