subcubic graph
graph where every vertex has at most 3 neighbors
Facts
4 properties- Instance of
- class of the graphs without certain subgraphs
- Does not have part
- star graph S4[5]
- Has characteristic
- maximum vertex degree[4]
🏷️ Also known as
en subcubic graph
de subkubischer Graph
ru субкубический граф
🔖 Identifiers · 1
- Graphclasses.org ID
- gc_720
Press Enter · cited answer in seconds
0 sources
Summary
subcubic graph is a class of the graphs without certain subgraphs[1].