Extremal digraphs whose walks with the same initial and terminal vertices have distinct lengths

DOI10.1016/J.DISC.2012.04.008zbMath1246.05080OpenAlexW2051681317MaRDI QIDQ442298

Xingzhi Zhan, Ze-Jun Huang

Publication date: 10 August 2012

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.disc.2012.04.008

zbMATH Keywords

digraphwalkextremal digraph

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Directed graphs (digraphs), tournaments (05C20)

Related Items (4)

Sizes and transmissions of digraphs with a given clique number ⋮ On \(k\)-idempotent 0-1 matrices ⋮ The stable index of 0-1 matrices ⋮ Idempotent zero patterns

Cites Work

• Unnamed Item
• Unnamed Item
• Digraphs that have at most one walk of a given length with the same endpoints
• On the 0-1 matrices whose squares are 0-1 matrices

This page was built for publication: Extremal digraphs whose walks with the same initial and terminal vertices have distinct lengths