scientific article; zbMATH DE number 1095172
From MaRDI portal
Publication:4368729
zbMath0883.00011MaRDI QIDQ4368729
No author found.
Publication date: 8 December 1997
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Proceedings, conferences, collections, etc. pertaining to combinatorics (05-06) Collections of articles of miscellaneous specific interest (00B15)
Related Items (only showing first 100 items - show all)
EQUITABLE DOMINATION IN GRAPHS ⋮ On trees with equal 2-domination and 2-outer-independent domination numbers ⋮ Paired-domination in claw-free graphs ⋮ Global dominating sets in minimum coloring ⋮ Traceability of connected domination critical graphs ⋮ Partitioning claw-free subcubic graphs into two dominating sets ⋮ The p-domination number of complete multipartite graphs ⋮ Total \(\{k\}\)-domination in special graphs ⋮ Construction for trees without domination critical vertices ⋮ Roman domination in direct product graphs and rooted product graphs ⋮ Exact algorithms for weak Roman domination ⋮ Graphs with large semipaired domination number ⋮ Iterative construction of the minimum independent dominating sets in hypercube graphs ⋮ Total Roman domination in the lexicographic product of graphs ⋮ On the super domination number of lexicographic product graphs ⋮ On the weak Roman domination number of lexicographic product graphs ⋮ When an optimal dominating set with given constraints exists ⋮ On the complexity of variations of mixed domination on graphs† ⋮ On the \([1,2\)-domination number of generalized Petersen graphs] ⋮ \(k\)-domination and total \(k\)-domination numbers in catacondensed hexagonal systems ⋮ Distance paired domination numbers of graphs ⋮ Nordhaus-Gaddum bounds for total domination ⋮ Changing and unchanging isolate domination: Edge removal ⋮ Disjunctive total domination in permutation graphs ⋮ Construction of trees and graphs with equal domination parameters ⋮ Extensions of the Art Gallery Theorem ⋮ Hardness and approximation results of Roman \{3\}-domination in graphs ⋮ The restrained domination and independent restrained domination in extending supergrid graphs ⋮ On the Structure of Graphs Vertex Critical with Respect to Connected Domination ⋮ The domination number of Cartesian product of two directed paths ⋮ Restrained domination and its variants in extended supergrid graphs ⋮ On matching and semitotal domination in graphs ⋮ Distributed algorithm for the maximal 2-packing in geometric outerplanar graphs ⋮ A decomposition approach for solving a broadcast domination network design problem ⋮ Rainbow reinforcement numbers in digraphs ⋮ Total and paired domination numbers of toroidal meshes ⋮ Generalized perfect domination in graphs ⋮ Bounds on neighborhood total domination in graphs ⋮ Computing a minimum outer-connected dominating set for the class of chordal graphs ⋮ Self-stabilizing algorithms for efficient sets of graphs and trees ⋮ A linear time algorithm for liar's domination problem in proper interval graphs ⋮ Algorithmic aspect of stratified domination in graphs ⋮ Rainbow domination and related problems on strongly chordal graphs ⋮ On \(4\)-\(\gamma_t\)-critical graphs of diameter two ⋮ Efficient self-stabilizing algorithms for minimal total \(k\)-dominating sets in graphs ⋮ Bounds on the connected domination number of a graph ⋮ Irreversible conversion processes with deadlines ⋮ The algorithmic complexity of bondage and reinforcement problems in bipartite graphs ⋮ Graphs with maximum size and given paired-domination number ⋮ Extended chain of domination parameters in graphs ⋮ \(k\)-tuple total restrained domination in complementary prisms ⋮ On the uniqueness of \(D\)-vertex magic constant ⋮ Bounds on the vertex-edge domination number of a tree ⋮ Independence andk-domination in graphs ⋮ An exact algorithm for the minimum dominating clique problem ⋮ On the 2-rainbow domination in graphs ⋮ Paired-domination in generalized claw-free graphs ⋮ On equality in an upper bound for the restrained and total domination numbers of a graph ⋮ A lower bound on the total signed domination numbers of graphs ⋮ Complexity of Total {k}-Domination and Related Problems ⋮ Total restrained domination numbers of trees ⋮ New bounds on the \(k\)-domination number and the \(k\)-tuple domination number ⋮ The total domination and total bondage numbers of extended de Bruijn and Kautz digraphs ⋮ Domination When the Stars Are Out ⋮ Nordhaus-Gaddum results for restrained domination and total restrained domination in graphs ⋮ On domination and reinforcement numbers in trees ⋮ Matching properties in connected domination critical graphs ⋮ Domination in graphs of minimum degree at least two and large girth ⋮ Distance domination-critical graphs ⋮ On graphs with equal domination and 2-domination numbers ⋮ On matching and total domination in graphs ⋮ A note on power domination in grid graphs ⋮ Locating and total dominating sets in trees ⋮ Improved bottleneck domination algorithms ⋮ Some bounds on the \(p\)-domination number in trees ⋮ On the dominator coloring in proper interval graphs and block graphs ⋮ Power domination in graphs ⋮ b-Disjunctive Total Domination in Graphs: Algorithm and Hardness Results ⋮ Simultaneous graph parameters: factor domination and factor total domination ⋮ Majority reinforcement number ⋮ Minimum 2-tuple dominating set of permutation graphs ⋮ The k-domatic number of a graph ⋮ Packing functions and dominating functions of countable graphs ⋮ Domination parameters in coronene torus network ⋮ Secure restrained domination in graphs ⋮ Changing and unchanging of the domination number of a graph ⋮ Total limited packing in graphs ⋮ Roman domination in graphs: The class ℛUV R ⋮ Graph Critical With Respect To Independent Domination ⋮ A Characterization of the extended DII-sequence ⋮ Signed domatic number of a graph ⋮ 2-bondage in graphs ⋮ A refined search tree technique for dominating set on planar graphs ⋮ Trees with two disjoint minimum independent dominating sets ⋮ Bondage number of the discrete torus \(C_n\times C_4\) ⋮ A lower bound for the distance \(k\)-domination number of trees ⋮ Bicritical domination ⋮ Broadcasts in graphs ⋮ Stratification and domination in graphs with minimum degree two ⋮ Exact and Approximate Algorithms for Movement Problems on (Special Classes of) Graphs
This page was built for publication:
