A smallest irregular oriented graph containing a given diregular one

DOI10.1016/J.DISC.2003.11.049MaRDI QIDQ1883255zbMATH OpenOpenAlexFDO

Authors Joanna Górska, Zdzisław Skupień, Zofia Majcher, Jerzy Michael

Publication date 1 October 2004

Published in Discrete Mathematics (Search for Journal in Brave)

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

zbMATH Keywords

oriented graphregular digraphirregular digraph

Mathematics Subject Classification ID

Directed graphs (digraphs), tournaments (05C20)

Recommendations

• The minimum size of fully irregular oriented graphs
• Smallest regular graphs with prescribed odd girth
• Minimal regular graph containing a given graph
• Smallest regular graphs of given degree and diameter
• The smallest regular graphs which are not 1-extendable.
• Nonregular graphs with minimal total irregularity
• The minimal total irregularity of some classes of graphs
• scientific article; zbMATH DE number 3968625
• On smallest regular graphs with a given isopart
• A strongly regular \(n\)-full graph of small order

Cites work

• scientific article; zbMATH DE number 4134079 (Why is no real title available?)
• scientific article; zbMATH DE number 4089545 (Why is no real title available?)
• scientific article; zbMATH DE number 4097437 (Why is no real title available?)
• scientific article; zbMATH DE number 15351 (Why is no real title available?)
• scientific article; zbMATH DE number 140040 (Why is no real title available?)
• scientific article; zbMATH DE number 907924 (Why is no real title available?)
• Asymptotic formulas for the number of oriented graphs
• Degree sequences of digraphs with highly irregular property
• Highly irregular digraphs
• Highly irregular graphs
• Irregular Assignments of Trees and Forests
• Irregular networks, regular graphs and integer matrices with distinct row and column sums
• Problems on fully irregular digraphs
• The irregularity strength and cost of the union of cliques
• The minimum size of fully irregular oriented graphs
• Vertex-distinguishing proper edge-colorings

Cited in

(4)

• The minimum size of fully irregular oriented graphs
• Irregularity strength of digraphs
• Extremal irregular digraphs
• Large minimal irregular digraphs

This page was built for publication: A smallest irregular oriented graph containing a given diregular one

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