scientific article; zbMATH DE number 4130427
From MaRDI portal
Publication:3032297
Recommendations
Cited in
(38)- Minimum fractional dominating functions and maximum fractional packing functions
- Generalized domination and efficient domination in graphs
- Universal maximal packing functions of graphs
- Real and integer domination in graphs
- A recurrence template for several parameters in series-parallel graphs
- Classes of graphs for which upper fractional domination equals independence, upper domination, and upper irredundance
- The determinant of a tree's neighborhood matrix
- Laplacian distribution and domination
- Maximal irredundant functions
- On the uniqueness of \(D\)-vertex magic constant
- Roman dominating influence parameters
- Packing functions and dominating functions of countable graphs
- On the efficiency index of a graph
- Minimum fractional totally dominating functions and maximum fractional open neighborhood packings in connected finite graphs
- scientific article; zbMATH DE number 6613603 (Why is no real title available?)
- Distance domination in graphs
- Fractional dominating parameters
- scientific article; zbMATH DE number 5073493 (Why is no real title available?)
- scientific article; zbMATH DE number 637524 (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 1156657 (Why is no real title available?)
- Fractional distance domination in graphs
- Integer and fractional packing of families of graphs
- scientific article; zbMATH DE number 2170404 (Why is no real title available?)
- Integer and fractional packings in dense 3‐uniform hypergraphs
- scientific article; zbMATH DE number 759647 (Why is no real title available?)
- A Taxonomy of Perfect Domination
- Coefficient of domination in graph
- scientific article; zbMATH DE number 4189776 (Why is no real title available?)
- Extremal problems related to the cardinality-redundance of graphs
- 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
- Fault tolerant detectors for distinguishing sets in graphs
- Queen's domination using border squares and \((A,B)\)-restricted domination
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 Q3032297)
