Bounds for the Kirchhoff index via majorization techniques

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

Bounds for the Kirchhoff index via majorization techniques

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

Risultato della ricerca: Working paper › Documento di lavoro

Abstract

Using a majorization technique that identifies the maximal and minimal vectors of a variety of subsets of Rⁿ, 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.

Lingua originale	Inglese
Numero di pagine	17
Stato di pubblicazione	Pubblicato - 2012

Keywords

Kirchhoff index
Schur-convex functions
graphs
majorization order

Altri file e collegamenti

Cita questo

@techreport{503663464e5e4838b0b6c57fe9455f29,

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ⁿ, 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 = "Kirchhoff index, Schur-convex functions, graphs, majorization order, Kirchhoff index, Schur-convex functions, graphs, majorization order",

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

year = "2012",

language = "English",

type = "WorkingPaper",

}

TY - UNPB

T1 - Bounds for the Kirchhoff index via majorization techniques

AU - Torriero, Anna

AU - Bianchi, Monica

AU - Cornaro, Alessandra

AU - Palacios, José Luis

PY - 2012

Y1 - 2012

N2 - Using a majorization technique that identifies the maximal and minimal vectors of a variety of subsets of Rⁿ, 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ⁿ, 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 - Kirchhoff index

KW - Schur-convex functions

KW - graphs

KW - majorization order

KW - Kirchhoff index

KW - Schur-convex functions

KW - graphs

KW - majorization order

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

UR - http://www.cesma.usb.ve/reportes/2012-01.pdf

M3 - Working paper

BT - Bounds for the Kirchhoff index via majorization techniques

ER -

Bounds for the Kirchhoff index via majorization techniques

Abstract

Keywords

Altri file e collegamenti

Fingerprint

Cita questo