Sharp bounds for the Randić index of graphs with given minimum and maximum degree

The Randić index of a graph G, written R(G), is the sum of 1d(u)d(v) over all edges uv in E(G). Let d and D be positive integers d

Saved in:
Bibliographic Details
Published in:Discrete Applied Mathematics 2018-10, Vol.247, p.111-115
Main Authors: O, Suil, Shi, Yongtang
Format: Article
Language:English
Subjects:
Branch & bound algorithms
Combinatorics
Generalized linear models
Graph theory
Integers
Maximum degree
Maximum likelihood method
Minimum degree
Randic index
Citations: Items that this one cites
Items that cite this one
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:The Randić index of a graph G, written R(G), is the sum of 1d(u)d(v) over all edges uv in E(G). Let d and D be positive integers d
ISSN:0166-218X
1872-6771
DOI:10.1016/j.dam.2018.03.064