scientific article; zbMATH DE number 5054148
From MaRDI portal
Publication:5488331
zbMath1103.05087MaRDI QIDQ5488331
Teresa W. Haynes, Sandra M. Hedetniemi, Stephen T. Hedetniemi, J. L. Mashburn, Peter J. Slater
Publication date: 14 September 2006
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Games involving graphs (91A43) Graph theory (05C99) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)
Related Items (30)
Relations between the differential and parameters in graphs ⋮ On the perfect differential of a graph ⋮ The differential of the line graph \(\mathcal{L} (G)\) ⋮ Efficient domination of the orientations of a graph ⋮ On the differential and Roman domination number of a graph with minimum degree two ⋮ Minimal Roman dominating functions: extensions and enumeration ⋮ \(W_2\)-graphs and shedding vertices ⋮ Differential in complementary prisms ⋮ On the D-differential of a graph ⋮ Data reductions and combinatorial bounds for improved approximation algorithms ⋮ Some results related to the toughness of 3-domination critical graphs ⋮ Client-server and cost effective sets in graphs ⋮ Computing the differential of a graph: hardness, approximability and exact algorithms ⋮ Combinatorics for smaller kernels: the differential of a graph ⋮ On the differential polynomial of a graph ⋮ From the strong differential to Italian domination in graphs ⋮ A proof of a conjecture on the differential of a subcubic graph ⋮ Lower bounds on the differential of a graph ⋮ Combinatorial properties of a general domination problem with parity constraints ⋮ Fall colouring of bipartite graphs and Cartesian products of graphs ⋮ On the 2-packing differential of a graph ⋮ The \(N\)-queens problem on a symmetric Toeplitz matrix ⋮ Roman Domination in Graphs ⋮ Roman domination in graphs: The class ℛUV R ⋮ 1-well-covered graphs revisited ⋮ Computational study on planar dominating set problem ⋮ Vertex domination of generalized Petersen graphs ⋮ \(\beta\)-differential of a graph ⋮ A refined search tree technique for dominating set on planar graphs ⋮ Unique irredundance, domination and independent domination in graphs
This page was built for publication:
