Articoli correlati a Vertex Cycle Cover: Graph (Mathematics), Spanning Subgraph,...

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

 
9786131135354: Vertex Cycle Cover: Graph (Mathematics), Spanning Subgraph, Subgraph, Cycle (Graph Theory), Digraphs
Brossura
ISBN 10: 6131135355 ISBN 13: 9786131135354
Casa editrice: OmniScriptum, 2010

Sinossi

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.

Le informazioni nella sezione "Riassunto" possono far riferimento a edizioni diverse di questo titolo.

Reseņa del editor

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.

Le informazioni nella sezione "Su questo libro" possono far riferimento a edizioni diverse di questo titolo.

Editore
OmniScriptum
Data di pubblicazione
2010
Lingua
Inglese
ISBN 10 
6131135355
ISBN 13 
9786131135354
Rilegatura
Tapa blanda
Numero di pagine
64
Redattore
Surhone Lambert M., Timpledon Miriam T., Marseken Susan F.
Contatto del produttore
non disponibile
Persona responsabile
non disponibile