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

DOI10.1016/J.DISC.2012.04.008MaRDI QIDQ442298zbMATH OpenOpenAlexFDO

Authors Xingzhi Zhan, Zejun 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

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

Recommendations

• Digraphs that contain at most \(t\) distinct walks of a given length with the same endpoints
• A note on extremal digraphs containing at most \(t\) walks of length \(k\) with the same endpoints
• Extremal digraphs avoiding distinct walks of length 3 with the same endpoints
• Extremal digraphs avoiding distinct walks of length 4 with the same endpoints
• Digraphs that have at most one walk of a given length with the same endpoints
• scientific article; zbMATH DE number 1355278
• scientific article; zbMATH DE number 3910417
• A Turán problem on digraphs avoiding distinct walks of a given length with the same endpoints
• On extremal graphs with no long paths
• scientific article; zbMATH DE number 4134078

Cites work

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

Cited in

(13)

• scientific article; zbMATH DE number 3910417 (Why is no real title available?)
• Sizes and transmissions of digraphs with a given clique number
• Digraphs that have at most one walk of a given length with the same endpoints
• scientific article; zbMATH DE number 4134078 (Why is no real title available?)
• Extremal oriented graphs avoiding 1-subdivision of an in-star
• A Turán problem on digraphs avoiding distinct walks of a given length with the same endpoints
• On k-idempotent 0-1 matrices
• The stable index of 0-1 matrices
• Digraphs that contain at most \(t\) distinct walks of a given length with the same endpoints
• A note on extremal digraphs containing at most \(t\) walks of length \(k\) with the same endpoints
• Extremal digraphs avoiding distinct walks of length 3 with the same endpoints
• Idempotent zero patterns
• Extremal digraphs avoiding distinct walks of length 4 with the same endpoints

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q442298)