Recherche à voisinage variable de graphes extrémaux 26. Nouveaux résultats sur la maille

Mustapha Aouchiche; Odile Favaron; Pierre Hansen

doi:10.1051/ro/2009022

Recherche à voisinage variable de graphes extrémaux 26. Nouveaux résultats sur la maille

Translated title of the contribution: Variable neighborhood study of extremal graphs 26. New results on the mesh

Mustapha Aouchiche, Odile Favaron, Pierre Hansen

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

2 Citations (Scopus)

Abstract

Using the AutoGraphiX 2 system (AGX2), we study relations between graph invariants of the form b_-n≤g⊕i≤b̄_n where g denotes the girth of a graph g=(V,E), i another invariant among the average distance l̄the index λ₁, the Randić index R and the domination number ß,⊕ denotes one of the four operations +,-,×,/,b_nand b̄_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). The results proved or discussed below were first presented as conjectures in a previous paper published in RAIRO Operations Research [RAIRO Oper. Res. 39 (2005) 275-293].

Translated title of the contribution	Variable neighborhood study of extremal graphs 26. New results on the mesh
Original language	French
Pages (from-to)	339-358
Number of pages	20
Journal	RAIRO - Operations Research
Volume	43
Issue number	4
DOIs	https://doi.org/10.1051/ro/2009022
Publication status	Published - 2009
Externally published	Yes

Keywords

AGX
Distance
Domination.
Girth
Graph
Index
Randić

ASJC Scopus subject areas

Theoretical Computer Science
Computer Science Applications
Management Science and Operations Research

Access to Document

10.1051/ro/2009022

Cite this

@article{4d474af67e1e464584a70fc1570eadec,

title = "Recherche {\`a} voisinage variable de graphes extr{\'e}maux 26. Nouveaux r{\'e}sultats sur la maille",

abstract = "Using the AutoGraphiX 2 system (AGX2), we study relations between graph invariants of the form b-n≤g⊕i≤{\=b}n where g denotes the girth of a graph g=(V,E), i another invariant among the average distance {\=l}the index λ1, the Randi{\'c} index R and the domination number {\ss},⊕ denotes one of the four operations +,-,×,/,bnand {\=b}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). The results proved or discussed below were first presented as conjectures in a previous paper published in RAIRO Operations Research [RAIRO Oper. Res. 39 (2005) 275-293].",

keywords = "AGX, Distance, Domination., Girth, Graph, Index, Randi{\'c}",

author = "Mustapha Aouchiche and Odile Favaron and Pierre Hansen",

year = "2009",

doi = "10.1051/ro/2009022",

language = "French",

volume = "43",

pages = "339--358",

journal = "RAIRO - Operations Research",

issn = "0399-0559",

publisher = "EDP Sciences",

number = "4",

}

TY - JOUR

T1 - Recherche à voisinage variable de graphes extrémaux 26. Nouveaux résultats sur la maille

AU - Aouchiche, Mustapha

AU - Favaron, Odile

AU - Hansen, Pierre

PY - 2009

Y1 - 2009

N2 - Using the AutoGraphiX 2 system (AGX2), we study relations between graph invariants of the form b-n≤g⊕i≤b̄n where g denotes the girth of a graph g=(V,E), i another invariant among the average distance l̄the index λ1, the Randić index R and the domination number ß,⊕ denotes one of the four operations +,-,×,/,bnand b̄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). The results proved or discussed below were first presented as conjectures in a previous paper published in RAIRO Operations Research [RAIRO Oper. Res. 39 (2005) 275-293].

AB - Using the AutoGraphiX 2 system (AGX2), we study relations between graph invariants of the form b-n≤g⊕i≤b̄n where g denotes the girth of a graph g=(V,E), i another invariant among the average distance l̄the index λ1, the Randić index R and the domination number ß,⊕ denotes one of the four operations +,-,×,/,bnand b̄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). The results proved or discussed below were first presented as conjectures in a previous paper published in RAIRO Operations Research [RAIRO Oper. Res. 39 (2005) 275-293].

KW - AGX

KW - Distance

KW - Domination.

KW - Girth

KW - Graph

KW - Index

KW - Randić

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

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

U2 - 10.1051/ro/2009022

DO - 10.1051/ro/2009022

M3 - Article

AN - SCOPUS:71049115129

SN - 0399-0559

VL - 43

SP - 339

EP - 358

JO - RAIRO - Operations Research

JF - RAIRO - Operations Research

IS - 4

ER -

Recherche à voisinage variable de graphes extrémaux 26. Nouveaux résultats sur la maille

Abstract

Keywords

ASJC Scopus subject areas

Access to Document

Other files and links

Fingerprint

Cite this