Sizes and transmissions of digraphs with a given clique number

DOI10.1007/s10878-015-9850-5zbMath1339.05161OpenAlexW1983803774MaRDI QIDQ281810

Huiqiu Lin, Ze-Jun Huang

Publication date: 11 May 2016

Published in: Journal of Combinatorial Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10878-015-9850-5

zbMATH Keywords

transmissiondigraphsizeclique number

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Directed graphs (digraphs), tournaments (05C20) Connectivity (05C40)

Related Items (2)

Maximum size of digraphs with some parameters ⋮ On the Wiener index of orientations of graphs

Cites Work

• Unnamed Item
• Unnamed Item
• Extremal digraphs whose walks with the same initial and terminal vertices have distinct lengths
• Digraphs that have at most one walk of a given length with the same endpoints
• The maximum size of graphs with a unique \(k\)-factor
• Maximum number of edges in connected graphs with a given domination number
• Maximum sizes of graphs with given restrained domination numbers
• On the number of edges in graphs with a given connected domination number
• On the sum of all distances in bipartite graphs
• On the sum of all distances in a graph or digraph
• On the size of graphs with complete-factors

This page was built for publication: Sizes and transmissions of digraphs with a given clique number