Recommendations
Cited in
(44)- Differential in complementary prisms
- Restrained differential of a graph
- Difference graphs
- On the differential polynomial of a graph
- On the perfect differential and perfect Roman domination in complementary prisms
- Unique response Roman domination versus 2-packing differential in complementary prisms
- Relations between the differential and parameters in graphs
- Combinatorics for smaller kernels: the differential of a graph
- On the D-differential of a graph
- From the strong differential to Italian domination in graphs
- Minimal Roman dominating functions: extensions and enumeration
- Lower bounds on the differential of a graph
- Vertex domination of generalized Petersen graphs
- \(\beta\)-differential of a graph
- On the differential and Roman domination number of a graph with minimum degree two
- Differential in infrastructure networks
- Unique irredundance, domination and independent domination in graphs
- Efficient domination of the orientations of a graph
- The \(N\)-queens problem on a symmetric Toeplitz matrix
- On the differential of the graph operator \(\mathcal{S}_k (G)\)
- On the 2-packing differential of a graph
- Data reductions and combinatorial bounds for improved approximation algorithms
- Graphs of vectorial plateaued functions as difference sets
- Some results related to the toughness of 3-domination critical graphs
- On the differential in graphs
- Computational study on planar dominating set problem
- The differential of the line graph \(\mathcal{L} (G)\)
- A refined search tree technique for dominating set on planar graphs
- scientific article; zbMATH DE number 3921913 (Why is no real title available?)
- Computing the differential of a graph: hardness, approximability and exact algorithms
- A proof of a conjecture on the differential of a subcubic graph
- W₂-graphs and shedding vertices
- Differentials in certain classes of graphs
- Distribution of the null coefficients of the differential polynomial of the tree graphs
- The differential on graph operator \(\mathrm{R}(G)\)
- Roman domination in graphs
- Combinatorial properties of a general domination problem with parity constraints
- Minimal Roman dominating functions: extensions and enumeration
- Differential coloring of graphs
- Roman domination in graphs: the class \(\mathcal{R}_{UVR}\)
- On the perfect differential of a graph
- Client-server and cost effective sets in graphs
- Fall colouring of bipartite graphs and Cartesian products of graphs
- 1-well-covered graphs revisited
This page was built for publication: Differentials in graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5488331)
