Maximum size of digraphs with some parameters
From MaRDI portal
Publication:326498
DOI10.1007/s10878-015-9916-4zbMath1348.05089OpenAlexW803840415MaRDI QIDQ326498
Baoyindureng Wu, Huiqiu Lin, Jin-Long Shu
Publication date: 12 October 2016
Published in: Journal of Combinatorial Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10878-015-9916-4
Extremal problems in graph theory (05C35) Distance in graphs (05C12) Directed graphs (digraphs), tournaments (05C20) Connectivity (05C40)
Cites Work
- Sizes and transmissions of digraphs with a given clique number
- Distance and size in digraphs
- Digraphs that have at most one walk of a given length with the same endpoints
- Nordhaus-Gaddum-type theorem for Wiener index of graphs when decomposing into three parts
- Double-super-connected digraphs
- Relations between parameters of a graph
- Wiener indices of balanced binary trees
- Minimum cycle factors in quasi-transitive digraphs
- Wiener index of graphs with more than one cut-vertex
- Molecular graphs and the inverse Wiener index problem
- Four new sums of graphs and their Wiener indices
- Maximum number of edges in connected graphs with a given domination number
- Star forests, dominating sets and Ramsey-type problems
- Some approaches to a conjecture on short cycles in digraphs
- Maximum sizes of graphs with given domination parameters
- On the number of edges in graphs with a given connected domination number
- On the structure of the adjacency matrix of the line digraph of a regular digraph
- NORDHAUS–GADDUM-TYPE THEOREM FOR DIAMETER OF GRAPHS WHEN DECOMPOSING INTO MANY PARTS
- On Complementary Graphs
- Some nordhaus‐‐ gaddum‐type results
- Nordhaus–Gaddum‐type Theorems for decompositions into many parts
- Wiener index of trees: Theory and applications
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
