scientific article; zbMATH DE number 5054148
From MaRDI portal
Publication:5488331
zbMATH Open1103.05087MaRDI QIDQ5488331FDOQ5488331
Teresa W. Haynes, Peter Slater, Sandra M. Hedetniemi, Stephen T. Hedetniemi, J. L. Mashburn
Publication date: 14 September 2006
Title of this publication is not available (Why is that?)
Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Games involving graphs (91A43) Graph theory (05C99)
Cited In (36)
- Difference graphs
- Unique response Roman domination versus 2-packing differential in complementary prisms
- On the differential polynomial of a graph
- Roman Domination in Graphs
- Relations between the differential and parameters in graphs
- On the D-differential of a graph
- Combinatorics for smaller kernels: the differential of a graph
- Minimal Roman dominating functions: extensions and enumeration
- From the strong differential to Italian domination in graphs
- Vertex domination of generalized Petersen graphs
- Lower bounds on the differential of a graph
- \(\beta\)-differential of a graph
- On the differential and Roman domination number of a graph with minimum degree two
- 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 2-packing differential of a graph
- Graphs of vectorial plateaued functions as difference sets
- Data reductions and combinatorial bounds for improved approximation algorithms
- Some results related to the toughness of 3-domination critical 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
- Title not available (Why is that?)
- Computing the differential of a graph: hardness, approximability and exact algorithms
- A proof of a conjecture on the differential of a subcubic graph
- \(W_2\)-graphs and shedding vertices
- The differential on graph operator \(\mathrm{R}(G)\)
- Minimal Roman dominating functions: extensions and enumeration
- Combinatorial properties of a general domination problem with parity constraints
- 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
- Differential in complementary prisms
- 1-well-covered graphs revisited
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 Q5488331)
