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

Lambert M. Surhone

ISBN 10: 6131135355 / ISBN 13: 9786131135354

Published by Omniscriptum, 2010

About this Item

nach der Bestellung gedruckt Neuware - Printed after ordering - Please note that the content of this book primarily consists of articlesavailable from Wikipedia or other free sources online. In mathematics, avertex cycle cover (commonly called simply cycle cover) of a graph isthe set of cycles which are subgraphs of G and contain all vertices ofG. If the cycles of the cover have no vertices in common, the cover iscalled vertex-disjoint or sometimes simply disjoint cycle cover. In thiscase the set of the cycles constitutes a spanning subgraph of G. If thecycles of the cover have no edges in common, the cover is callededge-disjoint or simply disjoint cycle cover. Similar definitions may beintroduced for digraphs, in terms of directed cycles. The permanent of a01-matrix is equal to the number of cycle covers of a directed graphwith this adjacency matrix. This fact is used in a simplified proof ofthe fact that computation of the permanent is #P-complete.

Seller Inventory # 9786131135354

Bibliographic Details

• Title: Vertex Cycle Cover : Graph (Mathematics), Spanning Subgraph, Subgraph, Cycle (Graph Theory), Digraphs
• Publisher: Omniscriptum
• Publication Date: 2010
• Language: English
• ISBN 10: 6131135355
• ISBN 13: 9786131135354
• Binding: Taschenbuch
• Condition: Neu
• Dimensions: 220W x 150H x 4D millimeters 220 millimeters width by 150 millimeters height by 4 millimeters depth
• Weight: 113 grams

About this title

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.