scientific article; zbMATH DE number 434686
From MaRDI portal
Publication:3139522
Let \(G\) be a graph so that each vertex \(v\) of \(G\) is assigned a weight \(\omega(v)\). The weight \(\omega(U)\) of a set \(U\) of vertices of \(G\) is the sum of weights of vertices in \(U\). Let \(B\) be a \(k \times n\) matrix and \(x_ U\) be the characteristic vector of \(U\). An upper bound on \(\max \omega(U)\) is given, where the maximum is taken over all \(U\) satisfying \(B \cdot x_ U=0\). For the entire collection see [Zbl 0772.00026].
Recommendations
Cited in
(6)- A generalization of the Hoffman-Lovász upper bound on the independence number of a regular graph
- An upper bound on the independence number of a graph computable in polynomial-time
- Weighted matrix eigenvalue bounds on the independence number of a graph
- scientific article; zbMATH DE number 3882469 (Why is no real title available?)
- scientific article; zbMATH DE number 6116809 (Why is no real title available?)
- Study on the upper bound of the dependence number
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3139522)