Maximum size of digraphs with some parameters

Huiqiu Lin (), Jinlong Shu and Baoyindureng Wu ()
Additional contact information
Huiqiu Lin: East China University of Science and Technology
Jinlong Shu: East China Normal University
Baoyindureng Wu: Xinjiang University

Journal of Combinatorial Optimization, 2016, vol. 32, issue 3, No 19, 950 pages

Abstract: Abstract In this paper, we determine the maximum sizes of strong digraphs under the constraint that their some parameters are fixed, such as vertex connectivity, edge-connectivity, the number of cut vertices. The corresponding extremal digraphs are also characterized. In addition, we establish Nordhaus–Gaddum type theorem for the diameter when $$\overrightarrow{K_n}$$ K n → decomposing into many parts. We also pose a related conjecture for Wiener index of digraphs.

Keywords: Digraph; Diameter; Cut vertex; Connectivity; 05C50 (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-9916-4 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:32:y:2016:i:3:d:10.1007_s10878-015-9916-4

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

DOI: 10.1007/s10878-015-9916-4

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 ().