The \(P_3\)-domination in graphs (Q4921039)
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 6165194
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | The \(P_3\)-domination in graphs |
scientific article; zbMATH DE number 6165194 |
Statements
22 May 2013
0 references
\(P_3\)-domination number (of graph)
0 references
\(P_3\)-independence number (of graph)
0 references
\(P_3\)-domatic number (of graph)
0 references
\(P_3\)-neighbourhood graph
0 references
\(P_3\)-completeness number (of graph)
0 references
\(P_3\)-complete graph
0 references
0.7757051587104797
0 references
0.7756774425506592
0 references
0.7749646902084351
0 references
0.7619872093200684
0 references
