Title

Graphs of extremal weights

Abstract

Our main aim is to show that the Randić weight of a connected graph of order n is at least √n - 1. As shown by the stars, this bound is best possible.

Publication Title

Ars Combinatoria

This document is currently not available here.

Share

COinS