Variable neighborhood search for extremal graphs. 18. Conjectures and results about the randić index

Mustapha Aouchiche; Pierre Hansen; Maolin Zheng

Variable neighborhood search for extremal graphs. 18. Conjectures and results about the randić index

Mustapha Aouchiche, Pierre Hansen, Maolin Zheng

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

Abstract

Using the AutoGraphiX 2 system (AGX2), we study relations between graph invariants of the form lb_n ≤ R ⊕ i ≤ ub_n where R denotes the Randić index of a graph G = (V, E), i another invariant among matching number μ and the index (or the maximum eigenvalue) λ₁, ⊕ denotes one of the four operations +, -, x, /, while lb_n and ub_n lower and upper bounding functions of the order n of the graph considered which are tight for all n (except possibly very small values due to border effects). Conjectures are obtained in 14 out of 16 cases, 6 of which are proved automatically, 7 are proved by hand and one remains open.

Original language	English
Pages (from-to)	541-550
Number of pages	10
Journal	Match
Volume	56
Issue number	3
Publication status	Published - 2006
Externally published	Yes

ASJC Scopus subject areas

Chemistry(all)
Computer Science Applications
Computational Theory and Mathematics
Applied Mathematics

Cite this

@article{df4707d7e1cf4b748f093b8450290714,

title = "Variable neighborhood search for extremal graphs. 18. Conjectures and results about the randi{\'c} index",

abstract = "Using the AutoGraphiX 2 system (AGX2), we study relations between graph invariants of the form lbn ≤ R ⊕ i ≤ ubn where R denotes the Randi{\'c} index of a graph G = (V, E), i another invariant among matching number μ and the index (or the maximum eigenvalue) λ1, ⊕ denotes one of the four operations +, -, x, /, while lbn and ubn lower and upper bounding functions of the order n of the graph considered which are tight for all n (except possibly very small values due to border effects). Conjectures are obtained in 14 out of 16 cases, 6 of which are proved automatically, 7 are proved by hand and one remains open.",

author = "Mustapha Aouchiche and Pierre Hansen and Maolin Zheng",

year = "2006",

language = "English",

volume = "56",

pages = "541--550",

journal = "Match",

issn = "0340-6253",

publisher = "University of Kragujevac, Faculty of Science",

number = "3",

}

TY - JOUR

T1 - Variable neighborhood search for extremal graphs. 18. Conjectures and results about the randić index

AU - Aouchiche, Mustapha

AU - Hansen, Pierre

AU - Zheng, Maolin

PY - 2006

Y1 - 2006

N2 - Using the AutoGraphiX 2 system (AGX2), we study relations between graph invariants of the form lbn ≤ R ⊕ i ≤ ubn where R denotes the Randić index of a graph G = (V, E), i another invariant among matching number μ and the index (or the maximum eigenvalue) λ1, ⊕ denotes one of the four operations +, -, x, /, while lbn and ubn lower and upper bounding functions of the order n of the graph considered which are tight for all n (except possibly very small values due to border effects). Conjectures are obtained in 14 out of 16 cases, 6 of which are proved automatically, 7 are proved by hand and one remains open.

AB - Using the AutoGraphiX 2 system (AGX2), we study relations between graph invariants of the form lbn ≤ R ⊕ i ≤ ubn where R denotes the Randić index of a graph G = (V, E), i another invariant among matching number μ and the index (or the maximum eigenvalue) λ1, ⊕ denotes one of the four operations +, -, x, /, while lbn and ubn lower and upper bounding functions of the order n of the graph considered which are tight for all n (except possibly very small values due to border effects). Conjectures are obtained in 14 out of 16 cases, 6 of which are proved automatically, 7 are proved by hand and one remains open.

UR - http://www.scopus.com/inward/record.url?scp=33846434841&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=33846434841&partnerID=8YFLogxK

M3 - Article

AN - SCOPUS:33846434841

SN - 0340-6253

VL - 56

SP - 541

EP - 550

JO - Match

JF - Match

IS - 3

ER -

Variable neighborhood search for extremal graphs. 18. Conjectures and results about the randić index

Abstract

ASJC Scopus subject areas

Other files and links

Fingerprint

Cite this