scientific article; zbMATH DE number 5158519
From MaRDI portal
Publication:3439700
Cited in
(8)- Connected domination of regular graphs
- Coloring the normalized Laplacian for oriented hypergraphs
- Optimization of eigenvalue bounds for the independence and chromatic number of graph powers
- Sharp upper bounds on the \(k\)-independence number in graphs with given minimum and maximum degree
- On inertia and ratio type bounds for the k-independence number of a graph and their relationship
- On the independence number of graph powers
- On the k-independence number of graph products
- Evaluating a permutation of the power and complement operations of a graph with respect to its independence numbers
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 Q3439700)