Vertex Cycle Cover: Graph (Mathematics), Spanning Subgraph, Subgraph, Cycle (Graph Theory), Digraphs - Couverture souple

Couverture souple

ISBN 10 : 6131135355 ISBN 13 : 9786131135354

Editeur : Betascript Publishing, 2010

Synopsis

Please note that the content of this book primarily consists of articles available from Wikipedia or other free sources online. In mathematics, a vertex cycle cover (commonly called simply cycle cover) of a graph is the set of cycles which are subgraphs of G and contain all vertices of G. If the cycles of the cover have no vertices in common, the cover is called vertex-disjoint or sometimes simply disjoint cycle cover. In this case the set of the cycles constitutes a spanning subgraph of G. If the cycles of the cover have no edges in common, the cover is called edge-disjoint or simply disjoint cycle cover. Similar definitions may be introduced for digraphs, in terms of directed cycles. The permanent of a 01-matrix is equal to the number of cycle covers of a directed graph with this adjacency matrix. This fact is used in a simplified proof of the fact that computation of the permanent is #P-complete.

Détails de l'édition

• Éditeur: Betascript Publishing
• Date d'édition: 2010
• Langue: anglais
• ISBN 10: 6131135355
• ISBN 13: 9786131135354
• Reliure: Broché
• Nombre de pages: 64
• Éditeur: Surhone Lambert M., Timpledon Miriam T., Marseken Susan F.
• Coordonnées du fabricant: non disponible
• Personne responsable: non disponible