scientific article; zbMATH DE number 4189776
From MaRDI portal
Publication:5753985
Recommendations
Cited in
(27)- Minimum fractional dominating functions and maximum fractional packing functions
- Minus domination in graphs
- Real and integer domination in graphs
- The sequence of upper and lower domination, independence and irredundance numbers of a graph
- Classes of graphs for which upper fractional domination equals independence, upper domination, and upper irredundance
- The bondage and reinforcement numbers of \(\gamma_ f\) for some graphs
- Using maximality and minimality conditions to construct inequality chains
- Irredundance perfect graphs
- Maximal irredundant functions
- On bondage numbers of graphs: a survey with some comments
- Fractional domination game
- scientific article; zbMATH DE number 6381752 (Why is no real title available?)
- scientific article; zbMATH DE number 4130427 (Why is no real title available?)
- The private neighbor concept
- Distance domination in graphs
- Fractional dominating parameters
- scientific article; zbMATH DE number 4105008 (Why is no real title available?)
- scientific article; zbMATH DE number 1043893 (Why is no real title available?)
- scientific article; zbMATH DE number 1124596 (Why is no real title available?)
- scientific article; zbMATH DE number 1990679 (Why is no real title available?)
- Integer and fractional packing of families of graphs
- Integer and fractional packings in dense 3‐uniform hypergraphs
- Fractional eternal domination: securely distributing resources across a network
- On the computational complexity of upper fractional domination
- Bibliography on domination in graphs and some basic definitions of domination parameters
- Integer and fractional packings of hypergraphs
- Integer and fractional packings in dense graphs
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 Q5753985)
