On the maximum weight of a dense connected graph of given order and size

DOI10.1016/j.disc.2015.04.029zbMath1334.05055OpenAlexW623241377MaRDI QIDQ279225

Mirko Horňák, Ingo Schiermeyer, Stanlislav Jendroľ

Publication date: 27 April 2016

Published in: Discrete Mathematics (Search for Journal in Brave)

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

zbMATH Keywords

connected graphweight of a graphweight of an edge

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Connectivity (05C40) Signed and weighted graphs (05C22) Density (toughness, etc.) (05C42)

Related Items (1)

On the maximum weight of a sparse connected graph of given order and size

Cites Work

• On the maximum weight of a planar graph of given order and size
• Extending Kotzig's theorem
• The structure of 1-planar graphs
• On maximum weight of a bipartite graph of given order and size
• On a max-min problem concerning weights of edges
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: On the maximum weight of a dense connected graph of given order and size