Variable Neighborhood Search for Extremal Graphs. XI. Bounds on Algebraic Connectivity-Reference-Cited by-同舟云学术

Variable Neighborhood Search for Extremal Graphs. XI. Bounds on Algebraic Connectivity

Published:2005 Issue: Volume: Page:1-16
ISSN:
Container-title:Graph Theory and Combinatorial Optimization
language:
Short-container-title:

Author:

Belhaiza Slim,de Abreu Nair Maria Maia,Hansen Pierre,Oliveira Carla Silva

Publisher

Springer US

Link

http://link.springer.com/content/pdf/10.1007/0-387-25592-3_1

Reference21 articles.

1. Appel, K. and Haken, W. (1977a). Every planar map is four colorable. I. Discharging. Illinois Journal of Mathematics, 21:429–490.

2. Appel, K. and Haken, W. (1977b). Every planar map is four colorable. II. Reducibility. Illinois Journal of Mathematics, 21:491–567.

3. Appel, K. and Haken, W. (1989). Every Planar Map Is Four Colorable. Contemporary Mathematics, vol. 98. American Mathematical Society, Providence, RI.

4. Biggs, N. (1993). Algebraic Graph Theory, 2 ed. Cambridge University Press.

5. Caporossi, G. and Hansen, P. (2000). Variable neighborhood search for extremal graphs. I. The AutoGraphiX system. Discrete Mathematics, 212:29–44.

Cited by 6 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Fixed‐time orientation estimation and network localisation of multi‐agent systems;IET Control Theory & Applications;2020-12-08

2. Open problems on graph eigenvalues studied with AutoGraphiX;EURO Journal on Computational Optimization;2013-05

3. Signless Laplacian spectral radii of graphs with given chromatic number;Linear Algebra and its Applications;2011-10

4. Variable Neighborhood Search;Handbook of Metaheuristics;2010

5. Variable Neighborhood Search for Extremal Graphs 14: The AutoGraphiX 2 System;Global Optimization;2006