| Titre : |
Connectivity, independent sets and maximal circuits in undirected graphs |
| Type de document : |
texte imprimé |
| Auteurs : |
Ahmed Ainouche, Auteur ; Nicos Christofides, Directeur de thèse |
| Editeur : |
London : [s.n.] |
| Année de publication : |
1980 |
| Importance : |
192 f. |
| Présentation : |
ill. |
| Format : |
30 cm. |
| Note générale : |
PhD Thesis: Management science : University of London : 1980
Bibliogr. en fin de chapitre |
| Langues : |
Anglais (eng) |
| Mots-clés : |
Connectivity
Independent sets
Maximal circuits
Undirected graphs |
| Index. décimale : |
D002580 |
| Résumé : |
This thesis deals with (i) finding sufficient conditions for the existence of hamiltonian circuits (or paths) in undirected graphs, and (ii) the derivation of upper and lower bounds on the connectivity and independence number of a graph.
(i). A : New results are derived giving sufficient conditions for the existence of hamiltonian circuits in undirected graphs.
These results are stronger than the existing well known ones (eg : those of las vergnas, chvatal, bondy etc...).
Some of these results are of the "closure" type and dominate the bondy-chvàtal closure.
Most of the new results (both of the closure and global form) involve conditions on the independece number of the graph (or slight variations thereof).
Thus a degree of unification is achieved among the known and new conditions for the existence of hamiltonian circuits in graphs. |
Connectivity, independent sets and maximal circuits in undirected graphs [texte imprimé] / Ahmed Ainouche, Auteur ; Nicos Christofides, Directeur de thèse . - London : [s.n.], 1980 . - 192 f. : ill. ; 30 cm. PhD Thesis: Management science : University of London : 1980
Bibliogr. en fin de chapitre Langues : Anglais ( eng)
| Mots-clés : |
Connectivity
Independent sets
Maximal circuits
Undirected graphs |
| Index. décimale : |
D002580 |
| Résumé : |
This thesis deals with (i) finding sufficient conditions for the existence of hamiltonian circuits (or paths) in undirected graphs, and (ii) the derivation of upper and lower bounds on the connectivity and independence number of a graph.
(i). A : New results are derived giving sufficient conditions for the existence of hamiltonian circuits in undirected graphs.
These results are stronger than the existing well known ones (eg : those of las vergnas, chvatal, bondy etc...).
Some of these results are of the "closure" type and dominate the bondy-chvàtal closure.
Most of the new results (both of the closure and global form) involve conditions on the independece number of the graph (or slight variations thereof).
Thus a degree of unification is achieved among the known and new conditions for the existence of hamiltonian circuits in graphs. |
|
Ajouter le résultat dans votre panier Faire une suggestion Affiner la rechercheConnectivity, independent sets and maximal circuits in undirected graphs (1980)
