On special maximum matching constructing: Algorithms and Complexity - Couverture souple

Mkrtchyan, Vahan

 
9783659219146: On special maximum matching constructing: Algorithms and Complexity
Couverture souple
ISBN 10 : 3659219142 ISBN 13 : 9783659219146
Editeur : LAP LAMBERT Academic Publishing, 2012

Synopsis

Problem of existence and construction of matchings in various classes of graphs is one of the well-known and important directions of research carried out in Discrete Mathematics. The subject stems from the prominent “Marriage Problem” which is a problem of existence and construction of a system of distinct representatives, for which necessary and sufficient condition is found. The interest towards problems which are related to matchings is explained not only by their theoretical importance, but also by the essential role that matchings play in the various, sometimes unexpected applications of Combinatorial Mathematics in development of methods for solving various practical problems. In the present work the influence of a maximum matching of the given graph on the graph obtained by its removal is investigated. The work can be interesting to researchers who work especially with matchings and related structures.

Les informations fournies dans la section « Synopsis » peuvent faire référence à une autre édition de ce titre.

Présentation de l'éditeur

Problem of existence and construction of matchings in various classes of graphs is one of the well-known and important directions of research carried out in Discrete Mathematics. The subject stems from the prominent “Marriage Problem” which is a problem of existence and construction of a system of distinct representatives, for which necessary and sufficient condition is found. The interest towards problems which are related to matchings is explained not only by their theoretical importance, but also by the essential role that matchings play in the various, sometimes unexpected applications of Combinatorial Mathematics in development of methods for solving various practical problems. In the present work the influence of a maximum matching of the given graph on the graph obtained by its removal is investigated. The work can be interesting to researchers who work especially with matchings and related structures.

Biographie de l'auteur

Vahan Mkrtchyan, PhD in Mathematics. My main research area is graph theory. Currently, I teach at Yerevan State University.

Les informations fournies dans la section « A propos du livre » peuvent faire référence à une autre édition de ce titre.

Éditeur
LAP LAMBERT Academic Publishing
Date d'édition
2012
Langue
anglais
ISBN 10 
3659219142
ISBN 13 
9783659219146
Reliure
Broché
Nombre de pages
172
Coordonnées du fabricant
non disponible
Personne responsable
KreGa Onlinehandel GmbH
4950000000000
info@krega-onlinehandel.de

Birkenweg 31
Brakel
33034
Allemagne