A bound for the \(p\)-domination number of a graph in terms of its eigenvalue multiplicities (Q2104984)
From MaRDI portal
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A bound for the \(p\)-domination number of a graph in terms of its eigenvalue multiplicities |
scientific article |
Statements
A bound for the \(p\)-domination number of a graph in terms of its eigenvalue multiplicities (English)
0 references
8 December 2022
0 references
adjacency matrix
0 references
Laplacian matrix
0 references
eigenvalue multiplicity
0 references
\(p\)-domination number
0 references
total domination number
0 references
rank
0 references
0 references
