Sizes and transmissions of digraphs with a given clique number

Zejun Huang () and Huiqiu Lin ()
Additional contact information
Zejun Huang: Hunan University
Huiqiu Lin: East China University of Science and Technology

Journal of Combinatorial Optimization, 2016, vol. 31, issue 4, No 18, 1642-1649

Abstract: Abstract We determine the maximum and minimum sizes of digraphs with a given clique numbers as well as the digraphs that attain these extremal sizes. The maximum and minimum transmissions of connected digraphs with given clique numbers are also determined.

Keywords: Clique number; Digraph; Size; Transmission; 05C20; 05C69 (search for similar items in EconPapers)
Date: 2016
References: View complete reference list from CitEc
Citations:

Downloads: (external link)
http://link.springer.com/10.1007/s10878-015-9850-5 Abstract (text/html)
Access to the full text of the articles in this series is restricted.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:jcomop:v:31:y:2016:i:4:d:10.1007_s10878-015-9850-5

Ordering information: This journal article can be ordered from
https://www.springer.com/journal/10878

DOI: 10.1007/s10878-015-9850-5

Access Statistics for this article

Journal of Combinatorial Optimization is currently edited by Thai, My T.

More articles in Journal of Combinatorial Optimization from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().