Fractional dominating parameters
From MaRDI portal
Publication:3384613
Recommendations
Cites work
- A new polynomial-time algorithm for linear programming
- An inequality related to Vizing's conjecture
- Approximations of the domination number of a graph
- Classes of graphs for which upper fractional domination equals independence, upper domination, and upper irredundance
- Domination, Fractional Domination, 2-Packing, and Graph Products
- Domination, independent domination, and duality in strongly chordal graphs
- Fractional domination of strong direct products
- Fractional domination of the Cartesian products in graphs
- Fractional dominations and fractional total dominations of graph complements
- Generalized domination and efficient domination in graphs
- Graph products and integer domination
- scientific article; zbMATH DE number 4130427 (Why is no real title available?)
- scientific article; zbMATH DE number 436066 (Why is no real title available?)
- scientific article; zbMATH DE number 4049086 (Why is no real title available?)
- scientific article; zbMATH DE number 4085682 (Why is no real title available?)
- scientific article; zbMATH DE number 4105008 (Why is no real title available?)
- scientific article; zbMATH DE number 3557519 (Why is no real title available?)
- scientific article; zbMATH DE number 3637614 (Why is no real title available?)
- scientific article; zbMATH DE number 1043893 (Why is no real title available?)
- scientific article; zbMATH DE number 1151815 (Why is no real title available?)
- scientific article; zbMATH DE number 844153 (Why is no real title available?)
- scientific article; zbMATH DE number 867701 (Why is no real title available?)
- scientific article; zbMATH DE number 6116733 (Why is no real title available?)
- scientific article; zbMATH DE number 975353 (Why is no real title available?)
- scientific article; zbMATH DE number 975380 (Why is no real title available?)
- scientific article; zbMATH DE number 4189776 (Why is no real title available?)
- Minimum fractional dominating functions and maximum fractional packing functions
- On integer domination in graphs and Vizing-like problems
- On the computational complexity of upper fractional domination
- Real and integer domination in graphs
- The bondage and reinforcement numbers of \(\gamma_ f\) for some graphs
- Towards a theory of domination in graphs
- Transversal numbers of uniform hypergraphs
Cited in
(5)
This page was built for publication: Fractional dominating parameters
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3384613)