Bounds for the Kirchhoff index via majorization techniques

Anna Torriero; Monica Bianchi; José Luis Palacios; Alessandra Cornaro

doi:10.1007/s10910-012-0103-x

Bounds for the Kirchhoff index via majorization techniques

Anna Torriero
, Monica Bianchi
, José Luis Palacios
, Alessandra Cornaro

Universidad Simón Bolívar

Research output: Contribution to journal › Article › peer-review

47 Citations (Scopus)

Abstract

Using a majorization technique that identifies the maximal and minimal vectors of a variety of subsets of R^n, we find upper and lower bounds for the Kirchhoff index K(G) of an arbitrary simple connected graph G that improve those existing in the literature.

Original language	English
Pages (from-to)	569-587
Number of pages	19
Journal	Journal of Mathematical Chemistry
Volume	2013
DOIs	https://doi.org/10.1007/s10910-012-0103-x
Publication status	Published - 2013

Keywords

Graphs
Kirchhoff index
Majorization
Schur-convex functions

Access to Document

10.1007/s10910-012-0103-x

Cite this

@article{0c0c3064e85f4bf9a19e55fe64e1a4d2,

title = "Bounds for the Kirchhoff index via majorization techniques",

abstract = "Using a majorization technique that identifies the maximal and minimal vectors of a variety of subsets of R\textasciicircum{}n, we find upper and lower bounds for the Kirchhoff index K(G) of an arbitrary simple connected graph G that improve those existing in the literature.",

keywords = "Graphs, Kirchhoff index, Majorization, Schur-convex functions, Graphs, Kirchhoff index, Majorization, Schur-convex functions",

author = "Anna Torriero and Monica Bianchi and Palacios, \{Jos{\'e} Luis\} and Alessandra Cornaro",

year = "2013",

doi = "10.1007/s10910-012-0103-x",

language = "English",

volume = "2013",

pages = "569--587",

journal = "Journal of Mathematical Chemistry",

issn = "0259-9791",

publisher = "Springer Netherlands",

}

TY - JOUR

T1 - Bounds for the Kirchhoff index via majorization techniques

AU - Torriero, Anna

AU - Bianchi, Monica

AU - Palacios, José Luis

AU - Cornaro, Alessandra

PY - 2013

Y1 - 2013

N2 - Using a majorization technique that identifies the maximal and minimal vectors of a variety of subsets of R^n, we find upper and lower bounds for the Kirchhoff index K(G) of an arbitrary simple connected graph G that improve those existing in the literature.

AB - Using a majorization technique that identifies the maximal and minimal vectors of a variety of subsets of R^n, we find upper and lower bounds for the Kirchhoff index K(G) of an arbitrary simple connected graph G that improve those existing in the literature.

KW - Graphs

KW - Kirchhoff index

KW - Majorization

KW - Schur-convex functions

KW - Graphs

KW - Kirchhoff index

KW - Majorization

KW - Schur-convex functions

UR - http://hdl.handle.net/10807/37789

UR - http://www.springerlink.com/content/g1820p08v940j2l2/fulltext.pdf

U2 - 10.1007/s10910-012-0103-x

DO - 10.1007/s10910-012-0103-x

M3 - Article

SN - 0259-9791

VL - 2013

SP - 569

EP - 587

JO - Journal of Mathematical Chemistry

JF - Journal of Mathematical Chemistry

ER -

Bounds for the Kirchhoff index via majorization techniques

Abstract

Keywords

Access to Document

Other files and links

Fingerprint

Cite this