On the number of specific spanning subgraphs of the graphs \(G\times P_n\) (Q2713610)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 1602744
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | On the number of specific spanning subgraphs of the graphs \(G\times P_n\) |
scientific article; zbMATH DE number 1602744 |
Statements
10 June 2001
0 references
Cartesian product of graphs
0 references
spanning subgraph
0 references
path
0 references
On the number of specific spanning subgraphs of the graphs \(G\times P_n\) (English)
0 references
Cartesian products \(G\times P_n\), where \(G\) is an arbitrary graph and \(P_n\) is a path of length \(n\) are studied. The number of their spanning subgraphs with some prescribed conditions (acyclicity, connectedness, Hamiltonicity, restrictions and degrees) are investigated. Results are listed in tables.
0 references
0.801889181137085
0 references
0.7814911603927612
0 references
0.7783883213996887
0 references
