Second neighborhood via first neighborhood in digraphs

DOI10.1007/s00026-003-0195-xzbMath1017.05057OpenAlexW2088658217MaRDI QIDQ1400800

Jian Shen, Raphael Yuster, Guantao Chen

Publication date: 14 August 2003

Published in: Annals of Combinatorics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00026-003-0195-x

zbMATH Keywords

cycledigraphin-degreeneighborhoodout-degree

Mathematics Subject Classification ID

Paths and cycles (05C38) Directed graphs (digraphs), tournaments (05C20)

Related Items (13)

Seymour's Second Neighborhood Conjecture for Tournaments Missing a Generalized Star ⋮ The number of Seymour vertices in random tournaments and digraphs ⋮ On Seymour's second neighborhood conjecture of \(m\)-free digraphs ⋮ The second out-neighborhood for local tournaments ⋮ Seymour's second neighborhood conjecture for orientations of (pseudo)random graphs ⋮ Vertices with the second neighborhood property in Eulerian digraphs ⋮ The second neighbourhood for bipartite tournaments ⋮ A graph-theoretic approach for comparing dimensions of components in simply-graded algebras ⋮ Seymour's second neighborhood conjecture for \(m\)-free, \(k\)-transitive, \(k\)-anti-transitive digraphs and some approaches ⋮ The second neighbourhood for quasi-transitive oriented graphs ⋮ An Expansion Property of Boolean Linear Maps ⋮ The Arc‐Weighted Version of the Second Neighborhood Conjecture ⋮ Tournaments and Semicomplete Digraphs

This page was built for publication: Second neighborhood via first neighborhood in digraphs