Optimization and Highly Informative Graph Invariants
Zbornik radova, Tome 10 (2004) no. 18, p. 5
Voir la notice de l'article provenant de la source eLibrary of Mathematical Institute of the Serbian Academy of Sciences and Arts
It is known that graph invariants, which contain a great quantity
of information on graph structure (for example, spectral invariants), are obtained
by solving some extremal problems on graphs. Recently, such highly
informative graph invariants are applied in solving optimization problems on
graphs (e.g., the travelling salesman problem (TSP�. Using these paradigms,
several relations, interconnections and interactions between graph theory and
mathematical programming are described in this study. A model of TSP based
on semidefinite programming and algebraic connectivity of graphs is described.
A class of relaxations of this TSP model is defined and some solution techniques
based on this class are proposed. Several examples of graph invariants
defined by some kind of optimization tasks are also presented. Using several
spectrally based graph invariants we treat the graph isomorphism problem.
@article{ZR_2004_10_18_a1,
author = {Drago\v{s} Cvetkovi\'c and Mirjana \v{C}angalovi\'c and Vera Kova\v{c}evi\'c-Vuj\v{c}i\'c},
title = {Optimization and {Highly} {Informative} {Graph} {Invariants}},
journal = {Zbornik radova},
pages = {5 },
publisher = {mathdoc},
volume = {10},
number = {18},
year = {2004},
language = {en},
url = {http://geodesic.mathdoc.fr/item/ZR_2004_10_18_a1/}
}
Dragoš Cvetković; Mirjana Čangalović; Vera Kovačević-Vujčić. Optimization and Highly Informative Graph Invariants. Zbornik radova, Tome 10 (2004) no. 18, p. 5 . http://geodesic.mathdoc.fr/item/ZR_2004_10_18_a1/