Score sequences in oriented graphs

DOI10.1007/BF02831973MaRDI QIDQ874343zbMATH OpenFDO

Authors T. A. Naikoo, Shariefuddin Pirzada, Nasir A. Shah

Publication date 5 April 2007

Published in Journal of Applied Mathematics and Computing (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/BF02831973

zbMATH Keywords

tournamenttriples

Mathematics Subject Classification ID

Directed graphs (digraphs), tournaments (05C20)

Review text

The authors first give a new proof of Avery's theorem that characterizes the score sequences in oriented graphs. This new proof of Avery's theorem is obtained by using induction and is based on the proof of Landau's theorem on tournaments given by E. S. Mahmoodian and C. Thomassen. The authors also obtain some stronger inequalities for scores in oriented graphs and they characterize strongly transitive oriented graphs.

Recommendations

• On oriented graph scores
• Score sequences of oriented graphs
• Score sets in oriented graphs
• Landau's inequalities for tournament scores and a short proof of a theorem on transitive sub-tournaments
• scientific article; zbMATH DE number 1355273

Cites work

• scientific article; zbMATH DE number 5005329 (Why is no real title available?)
• Inequalities in oriented graph scores
• Landau's inequalities for tournament scores and a short proof of a theorem on transitive sub-tournaments
• Score sequences of oriented graphs

Cited in

(9)

• On scores in tournaments
• Tournaments, oriented graphs and football sequences
• Score sequences of oriented graphs
• On oriented graph scores
• On scores, losing scores and total scores in \(k\)-hypertournaments
• On imbalances in multipartite multidigraphs
• On the Zagreb index of tournaments
• On the scores and degrees in hypertournaments
• Degree sequence of oriented k-hypergraphs

This page was built for publication: Score sequences in oriented graphs

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