Graphs of Extremal Weights

Bollobdés, Béla; Erdos, Paul

Abstract

References

Ars Combinatoria

Volume 050
Pages: 225-233

Research article

Graphs of Extremal Weights

^¹, ^²

¹ Department of Pure Mathematics and Mathematical Statistics University of Cambridge 16 Mill Lane Cambridge CB3 9AX England

²Mathematical Institute of the Hungarian Academy of Sciences Redltanoda utca 13-15 Budapest H-1053 Hungary

Published: 31/12/1998

Download PDF
Cite

Copyright Link
License

Abstract

Our main aim is to show that the Randi\’e weight of a connected graph of order $n$ is at least $\sqrt{n - 1}$ . As shown by the stars, this bound is best possible.

Contents

Ars Combinatoria

Graphs of Extremal Weights

Abstract

Information

Guidelines

CP Initiatives

Follow CP