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
Disjunctive total domination in graphs, Weighted restrained domination in subclasses of planar graphs, Computing Roman domatic number of graphs, (Total) vector domination for graphs with bounded branchwidth, Signed Roman \(k\)-domination in digraphs, Edge criticality in graph domination, Isolate domination in graphs, Total and paired domination numbers of \(C_m\) bundles over a cycle \(C_n\), Locating-total dominating sets in twin-free graphs: a conjecture, Signed total Roman domination in graphs, The independent transversal dombondage number of a graph, Domination in graphoidally covered graphs: least-kernel graphoidal covers, Signed mixed Roman domination numbers in graphs, Location-domination in line graphs, Maximal 2-rainbow domination number of a graph, Liar's dominating sets in graphs, Exact and approximate algorithms for movement problems on (special classes of) graphs, A note on non-dominating set partitions in graphs, A characterization of locally semicomplete CKI-digraphs, On the rainbow domination number of digraphs, Algorithmic aspects of open neighborhood location-domination in graphs, On dominator colorings in graphs, \(H\)-kernels in infinite digraphs, Self-stabilizing algorithms for minimal dominating sets and maximal independent sets, An upper bound for the total restrained domination number of graphs, Coloring, location and domination of corona graphs, Total domination critical and stable graphs upon edge removal, Disjoint dominating and total dominating sets in graphs, Paired-domination in subdivided star-free graphs, Bounds on the total restrained domination number of a graph, On the ratio between 2-domination and total outer-independent domination numbers of trees, Total domination stable graphs upon edge addition, Graphs with disjoint dominating and paired-dominating sets, Bounds on the connected \(k\)-domination number in graphs, Domination versus independent domination in cubic graphs, Minimum paired-dominating set in chordal bipartite graphs and perfect elimination bipartite graphs, Upper bounds on the signed (\(k, k\))-domatic number, Dominating functions and total dominating functions of countable graphs, Parameterized complexity of max-lifetime target coverage in wireless sensor networks, Relating the annihilation number and the 2-domination number of a tree, Total domination dot-critical graphs, On the algorithmic complexity of \(k\)-tuple total domination, Domination and total domination in cubic graphs of large girth, \([1,2\)-domination in graphs], Total transversals and total domination in uniform hypergraphs, Total restrained domination in graphs of diameter 2 or 3, Improved bounds on the domination number of a tree, Total restrained domination in claw-free graphs with minimum degree at least two, On the complexity of the bondage and reinforcement problems, Loose cover of graphs, A lower bound on the total outer-independent domination number of a tree, Global secure sets of grid-like graphs, Directed domination in oriented graphs, Multiple factor Nordhaus-Gaddum type results for domination and total domination, On \(\alpha\)-total domination in graphs, NP-completeness and APX-completeness of restrained domination in graphs, On the roman domination in the lexicographic product of graphs, New results on 3-domination critical graphs, On the \((h,k)\)-domination numbers of iterated line digraphs, A note on total reinforcement in graphs, Total domination changing and stable graphs upon vertex removal, Efficient total domination in digraphs, A self-stabilizing algorithm for optimally efficient sets in graphs, Algorithmic aspects of \(k\)-tuple total domination in graphs, Upper bounds on the broadcast function using minimum dominating sets, Transversals and domination in uniform hypergraphs, An upper bound on the 2-outer-independent domination number of a tree, Towards a new framework for domination, The domination game played on unions of graphs, Dominating and total dominating partitions in cubic graphs, On a conjecture of Murty and Simon on diameter two critical graphs. II., The maximum diameter of total domination edge-critical graphs, The \(p\)-bondage number of trees, Perfect matchings in total domination critical graphs, \(k\)-domination and \(k\)-independence in graphs: A survey, Total domishold graphs: a generalization of threshold graphs, with connections to threshold hypergraphs, Signed total \((k,k)\)-domatic number of digraphs, A greedy partition lemma for directed domination, A proof of a conjecture on diameter 2-critical graphs whose complements are claw-free, Minimum 2-tuple dominating set of an interval graph, Simultaneous domination in graphs, Bounds on locating total domination number of the Cartesian product of cycles and paths, On a class of graphs between threshold and total domishold graphs, Signed Roman domination in digraphs, Progress on the Murty-Simon conjecture on diameter-2 critical graphs: a survey, A theorem of Ore and self-stabilizing algorithms for disjoint minimal dominating sets, Improved distributed local approximation algorithm for minimum 2-dominating set in planar graphs, Signed total Roman domination in digraphs, Relation between number of kernels (and generalizations) of a digraph and its partial line digraphs, A note on \(\alpha\)-total domination in cubic graphs, Linear-time algorithm for the paired-domination problem in convex bipartite graphs, Bounds on the locating-total domination number of a tree, On the existence of \(k\)-partite or \(K_p\)-free total domination edge-critical graphs, An extremal problem for total domination stable graphs upon edge removal, Total domination dot-stable graphs, On average lower independence and domination numbers in graphs, \(k\)-tuple total domination in graphs, Restricted power domination and fault-tolerant power domination on grids, On the distribution of the domination number for random class cover catch digraphs, Trees with 2-reinforcement number three, Domination number of catacondensed hexagonal systems, Semitotal domination on AT-free graphs and circle graphs, Hardness results of global Roman domination in graphs, A polyhedral view to a generalization of multiple domination, Transferable domination number of graphs, Probabilistic analysis of upper bounds for 2-connected distance \(k\)-dominating sets in graphs, Domination number in graphs with minimum degree two, Acyclic domination on bipartite permutation graphs, Optimal broadcast domination in polynomial time, Experiments on data reduction for optimal domination in networks, Critical cyclic patterns related to the domination number of the torus, Domination in partitioned graphs with minimum degree two, Restricted domination in graphs with minimum degree 2, Total restrained domination in trees, Matchings in 3-vertex-critical graphs: the odd case, On the \({k}\)-power domination of hypergraphs, Upper bounds on the signed total \((k, k)\)-domatic number of graphs, Some toughness results in independent domination critical graphs, Domination in 4-regular graphs with girth 3, A linear time algorithm for optimal \(k\)-hop dominating set of a tree, Complexity of total outer-connected domination problem in graphs, On dominating sets of maximal outerplanar and planar graphs, Bounds on the hop domination number of a tree, Locating-dominating sets in twin-free graphs, Bounds on the differentiating-total domination number of a tree, Global Roman domination in graphs, Location-domination and matching in cubic graphs, The upper bound on \(k\)-tuple domination numbers of graphs, Total domination in claw-free graphs with minimum degree 2, A characterization of \((2\gamma ,\gamma _{\text p})\)-trees, Bounds on total domination in claw-free cubic graphs, Total domination in partitioned trees and partitioned graphs with minimum degree two, Variations of \(Y\)-dominating functions on graphs, Total restrained domination in graphs with minimum degree two, On the domination number of Hamiltonian graphs with minimum degree six, Improved algorithms and complexity results for power domination in graphs, Proof of a conjecture on \(k\)-tuple domination in graphs, An upper bound for the restrained domination number of a graph with minimum degree at least two in terms of order and minimum degree, Domination, radius, and minimum degree, Bounds relating the weakly connected domination number to the total domination number and the matching number, Locating and paired-dominating sets in graphs, Properties of total domination edge-critical graphs, Restrained domination in claw-free graphs with minimum degree at least two, A tight bound on the number of mobile servers to guarantee transferability among dominating configurations, An upper bound on the paired-domination number in terms of the number of edges in the graph, On a conjecture on total domination in claw-free cubic graphs, Lower negative decision number in a graph, The total bondage number of grid graphs, A linear-time algorithm for paired-domination problem in strongly chordal graphs, Perfect graphs involving semitotal and semipaired domination, Algorithmic aspects of \(b\)-disjunctive domination in graphs, On the complexity of signed and minus total domination in graphs, Various bounds for liar's domination number, Vertices contained in all or in no minimum paired-dominating set of a tree, On an open problem concerning total domination critical graphs, Routing sets in the integer lattice, Restrained bondage in graphs, Paired bondage in trees, A survey of selected recent results on total domination in graphs, Domination in bipartite graphs, Efficiency in exponential time for domination-type problems, Upper bounds on the paired-domination number, Independent domination in subcubic bipartite graphs of girth at least six, An upper bound on the domination number of a graph with minimum degree 2, Upper bounds on the signed \((k,k)\)-domatic number of digraphs, \(k\)-tuple domination in graphs, Paired-domination in \(P_{5}\)-free graphs, Total domination in graphs with given girth, Roman domination in regular graphs, Connected domination of regular graphs, On the domination number of generalized petersen graphs \(P(n,2)\), The exact domination number of the generalized Petersen graphs, A note on dominating sets and average distance, Minimum fractional dominating functions and maximum fractional packing functions, On the \(\{k\}\)-domination number of Cartesian products of graphs, An analysis of the size of the minimum dominating sets in random recursive trees, using the Cockayne-Goodman-Hedetniemi algorithm, On total domination vertex critical graphs of high connectivity, Vertex and edge covers with clustering properties: Complexity and algorithms, Upper bounds on the \(k\)-domination number and the \(k\)-Roman domination number, On the diameter of a domination dot-critical graph, Average distances and distance domination numbers, Hardness results and approximation algorithms of \(k\)-tuple domination in graphs, Total domination in inflated graphs, Upper signed \(k\)-domination in a general graph, Constructive characterizations of \( (\gamma_p,\gamma)\)-and \( (\gamma_p, \gamma_{pr})\)-trees, Hardness results and approximation algorithms for (weighted) paired-domination in graphs, Distance paired-domination problems on subclasses of chordal graphs, On the algorithmic complexity of twelve covering and independence parameters of graphs, Domination and location in twin-free digraphs, Independent \((k + 1)\)-domination in \(k\)-trees, Double domination in lexicographic product graphs, Total domination in partitioned graphs, Graphs with large restrained domination number, Vertex domination of generalized Petersen graphs, More on limited packings in graphs, Total domination in planar graphs of diameter two, A survey of stratified domination in graphs, Domination with exponential decay, On global domination critical graphs, Remarks about disjoint dominating sets, 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, Perfect edge domination and efficient edge domination in graphs, On upper transversals in 3-uniform hypergraphs, The weighted independent domination problem is NP-complete for chordal graphs, Domination in some subclasses of bipartite graphs, A note on Roman domination of digraphs, Total domination subdivision numbers of trees, Stratification and domination in graphs. II, Computing a minimum paired-dominating set in strongly orderable graphs, On approximating (connected) 2-edge dominating set by a tree, On the global offensive alliance in unicycle graphs, Pairs of disjoint dominating sets in connected cubic graphs, Girth and total domination in graphs, Total domination and the Caccetta-Häggkvist conjecture, A generalized linear time algorithm for an optimal \(k\)-distance dominating set of a weighted tree, On the independent domination number of regular graphs, Domination parameters with number 2: interrelations and algorithmic consequences, Cubic graphs with total domatic number at least two, Domination parameters of a graph and its complement, On the total \(k\)-domination in graphs, On upper bounds for the independent transversal domination number, Total domination stability in graphs, Extremal hypergraphs for matching number and domination number, Power domination in circular-arc graphs, Lower bounds on the minus domination and \(k\)-subdomination numbers., Bounds on the domination number of a digraph, Weak \(\{2\}\)-domination number of Cartesian products of cycles, Nordhaus-Gaddum bounds for total Roman domination, Graphs with few total dominating sets, Defending the Roman Empire from multiple attacks, Non-isolating 2-bondage in graphs, Algorithm complexity of neighborhood total domination and \((\rho,\gamma_{\mathrm{nt}})\)-graphs, On computing a minimum secure dominating set in block graphs, Liar's domination in graphs: complexity and algorithm, Stratification and domination in graphs, On \(\alpha \)-domination in graphs, Total domination versus domination in cubic graphs, Changing and unchanging domination: A classification, \(H\)-domination in graphs, The complexity of secure domination problem in graphs, Total domination versus paired-domination in regular graphs, On the global Roman domination number in graphs, Some results for chessboard separation problems, On upper domination Ramsey numbers for graphs., On connected \(k\)-domination numbers of graphs., Pairs of disjoint dominating sets and the minimum degree of graphs, On the co-Roman domination in graphs, On the total Roman domination in trees, Domination and total domination on asteroidal triple-free graphs, Signed total domination in graphs., The bottleneck independent domination on the classes of bipartite graphs and block graphs., On the total forcing number of a graph, Paired-domination in claw-free graphs with minimum degree at least three, Algorithmic aspects of semitotal domination in graphs, On total \(f\)-domination: polyhedral and algorithmic results, The complexity of dominating set in geometric intersection graphs, Domination in 4-regular Knödel graphs, Algorithm to find a maximum 2-packing set in a cactus, Convex and isometric domination of (weak) dominating pair graphs, Subexponential fixed-parameter algorithms for partial vector domination, A note on independent vertex-edge domination in graphs, 2-domination number of generalized Petersen graphs, Dominating sets in intersection graphs of finite groups, The finite projective plane and the 5-uniform linear intersecting hypergraphs with domination number four, On upper total domination versus upper domination in graphs, Independent domination in bipartite cubic graphs, Restricted total domination in graphs, Paired-domination problem on distance-hereditary graphs, Complexity of \(k\)-rainbow independent domination and some results on the lexicographic product of graphs, Hardness results and approximation algorithm for total liar's domination in graphs, Decision and approximation complexity for identifying codes and locating-dominating sets in restricted graph classes, Some progress on the restrained Roman domination, Complexity and characterization aspects of edge-related domination for graphs, Bounds on the semipaired domination number of graphs with minimum degree at least two, Secure Italian domination in graphs, A characterization of trees based on edge-deletion and its applications for domination-type invariants, Secure total domination in graphs: bounds and complexity, Graphs with large total 2-rainbow domination number, Partitioning the vertices of a cubic graph into two total dominating sets, On the domination number of graphs with minimum degree six, Differentiating-total domination: approximation and hardness results, Algorithmic aspects of upper edge domination, Hamiltonicity of \(3_t\)EC graphs with \(\alpha=\kappa +1\), Hereditary equality of domination and exponential domination in subcubic graphs, Algorithmic aspects of secure connected domination in graphs, A continuous generalization of domination-like invariants, Domination for Latin square graphs, The spectral radius and domination number in linear uniform hypergraphs, Double vertex-edge domination in graphs: complexity and algorithms, An \(O(n+m)\) time algorithm for computing a minimum semitotal dominating set in an interval graph, Defending the Roman Empire---a new strategy, Parameterized complexity of vertex colouring, On \(d\)-distance \(m\)-tuple \((\ell,r)\)-domination in graphs, 3-tuple total domination number of Rook's graphs, Protection of lexicographic product graphs, The semitotal domination problem in block graphs, Admissible property of graphs in terms of radius, On the complexity of independent dominating set with obligations in graphs, Minus domination in graphs, On perfect neighborhood sets in graphs, On the differences between the upper irredundance, upper domination and independence numbers of a graph, Infinite quasi-transitive digraphs with domination number 2, On the Italian reinforcement number of a digraph, New bounds on the double domination number of trees, Isolation of \(k\)-cliques. II, Relating the outer-independent total Roman domination number with some classical parameters of graphs, Weak Roman domination in rooted product graphs, A note on the bounds of Roman domination numbers, Paired domination on interval and circular-arc graphs, Approximation algorithm and hardness results for defensive domination in graphs, Hardness results of connected power domination for bipartite graphs and chordal graphs, The Roman domatic problem in graphs and digraphs: a survey, Total protection of lexicographic product graphs, Restrained and total restrained domination in cographs, Classification of efficient dominating sets of circulant graphs of degree 5, Perfect Italian domination in graphs: complexity and algorithms, Decreasing the maximum degree of a graph, Complexity of paired domination in AT-free and planar graphs, A polynomial-time approximation to a minimum dominating set in a graph, Vertex-addition strategy for domination-like invariants, A linear-time algorithm for weighted paired-domination on block graphs, Results on vertex-edge and independent vertex-edge domination, The minimum number of vertices in uniform hypergraphs with given domination number, Linear kernels for \(k\)-tuple and liar's domination in bounded genus graphs, Isolation of cycles, H-kernels by walks in an \(R_H (D)\) digraph, The 2-rainbow domination of Sierpiński graphs and extended Sierpiński graphs, On 2-step and hop dominating sets in graphs, Signed total Roman edge domination in graphs, Distance domination in graphs with given minimum and maximum degree, Matching and domination numbers in \(r\)-uniform hypergraphs, Restrained domination in some subclasses of chordal graphs, Isolation of \(k\)-cliques, Semipaired domination in claw-free cubic graphs, The bondage number of generalized Petersen graphs \(P(n,2)\), Which graphs occur as \(\gamma\)-graphs?, Porous exponential domination in Harary graphs, Partitioning vertices into in- and out-dominating sets in digraphs, Algorithm and hardness results on neighborhood total domination in graphs, Domination number, independent domination number and 2-independence number in trees, A constructive characterization of vertex cover Roman trees, Global total \(k\)-domination: approximation and hardness results, Restrained domination in self-complementary graphs, Some variants of perfect graphs related to the matching number, the vertex cover and the weakly connected domination number, \( K_{1 , 2}\)-isolation in graphs, New parameter of inverse domination in graphs, The domination number of wrapped butterfly digraphs, \(F_3\)-domination problem of graphs, On the \(p\)-reinforcement and the complexity, Hardness results, approximation and exact algorithms for liar's domination problem in graphs, Domination in certain chemical graphs, On \(f\)-domination: polyhedral and algorithmic results, Quasi-total Roman domination in graphs, On a conjecture of Murty and Simon on diameter 2-critical graphs, The \(\alpha\)-spectral radius of uniform hypergraphs concerning degrees and domination number, Bounds on the locating-total domination number in trees, The Slater and sub-\(k\)-domination number of a graph with applications to domination and \(k\)-domination, Algorithmic aspects of upper paired-domination in graphs, Distributed approximation algorithms for \(k\)-dominating set in graphs of bounded genus and linklessly embeddable graphs, Algorithmic results on double Roman domination in graphs, Domination and matching in power and generalized power hypergraphs, Disjoint dominating and 2-dominating sets in graphs, Semitotal domination: new hardness results and a polynomial-time algorithm for graphs of bounded mim-width, On total domination and hop domination in diamond-free graphs, Efficient \(( t , r )\) broadcast dominating sets of the triangular lattice, About \((k, l)\)-kernels, semikernels and Grundy functions in partial line digraphs, Enumeration and maximum number of minimal dominating sets for chordal graphs, Bounds on neighborhood total domination number in graphs, Semitotal domination of Harary graphs, Outer-independent total Roman domination in graphs, Packing and domination parameters in digraphs, Positive influence domination in graphs, Domination in Cayley graphs: a survey, New algorithms for weighted \(k\)-domination and total \(k\)-domination problems in proper interval graphs, Extremal digraphs for an upper bound on the Roman domination number, On the \(k\)-domination number of digraphs, A new lower bound on the domination number of a graph, Semipaired domination in maximal outerplanar graphs, The total bondage numbers and efficient total dominations of vertex-transitive graphs, \(\beta\)-differential of a graph, Total and paired domination numbers of cylinders, Locating-dominating sets: from graphs to oriented graphs, Algorithm and hardness results on hop domination in graphs, Integer domination of Cartesian product graphs, Corona domination number of graphs, Domination versus disjunctive domination in trees, A note on connected domination number and leaf number, Co-Roman domination in graphs, A simple optimal algorithm for \(k\)-tuple dominating problem in interval graphs, Dominated colorings of graphs, Locating-paired-dominating sets in square grids, On \((t,r)\) broadcast domination numbers of grids, Trees with large neighborhood total domination number, Efficient \((j, k)\)-dominating functions, Elimination properties for minimal dominating sets of graphs, Polynomial time algorithm for \(k\)-vertex-edge dominating problem in interval graphs, A linear-time algorithm for paired-domination on circular-arc graphs, Total dominator colorings and total domination in graphs, An extension of Richardson's theorem in m-colored digraphs, A classification of cactus graphs according to their domination number, Improving a Nordhaus-Gaddum type bound for total domination using an algorithm involving vertex disjoint stars, The independent domination numbers of strong product of two cycles, Independent domination in directed graphs, γ-paired dominating graphs of cycles, Restrained domination polynomial in graphs, On K - duplication of graphs and some properties, Power domination number of sunlet graph and other graphs, Outer-weakly convex domination number of graphs, Semipaired Domination in Some Subclasses of Chordal Graphs, PENDANT TOTAL DOMINATION NUMBER OF SOME GENERALIZED GRAPHS, A lower bound on the double outer-independent domination number of a tree, Deterministic bootstrap percolation on trees, Parity Dimension for Graphs - A Linear Algebraic Approach, Domination in planar graphs with small diameter*, Game total domination subdivision number of a graph, Outer-connected independence in graphs, Outer independent Roman dominating functions in graphs, Total vertex-edge domination in graphs: Complexity and algorithms, The paired-domination and the upper paired-domination numbers of graphs, A note on complementary tree domination number of a tree, Equality co-neighborhood domination in graphs, Independent Domination in Cubic Graphs, ON HOP DOMINATION NUMBER OF SOME GENERALIZED GRAPH STRUCTURES, Fractional Vertex Covering Functions in Graphs, Further results on secure restrained domination in graphs, On coefficients of edge domination polynomial of a graph, Triple connected two out degree equitable domination number, On the perfect differential of a graph, The distinguishing number (index) and the domination number of a graph, Subexponential Fixed-Parameter Algorithms for Partial Vector Domination, Algorithmic Aspects of Disjunctive Domination in Graphs, Perfect Domination, Roman Domination and Perfect Roman Domination in Lexicographic Product Graphs, ON MULTIPLE INTRUDER LOCATING DOMINATION IN INFINITE GRIDS, Further results on maximal rainbow domination number, Correlation of domination parameters with physicochemical properties of octane isomers, Partially composed property of generalized lexicographic product graphs, Bounds on 2-point set domination number of a graph, Unicyclic graphs with equal domination and complementary tree domination numbers, Unnamed Item, Signed total domatic number of a graph, An optimal algorithm to find minimum k-hop dominating set of interval graphs, Domination cover number of graphs, Unnamed Item, TOTAL DOMINATION POLYNOMIALS OF SOME SPLITTING GRAPHS, Unnamed Item, Upper bounds on the bondage number of the strong product of a graph and a tree, A note on -vertex critical graphs, Convex domination in the composition and cartesian product of graphs, Minus total k-subdomination in graphs, Edge Weighting Functions on Dominating Sets, ON THE ROMAN BONDAGE NUMBER OF A GRAPH, On signed distance-k-domination in graphs, Hypergraphs with large transversal number and with edge sizes at least 3, Total domination in 2-connected graphs and in graphs with no induced 6-cycles, Min-max and max-min graph saturation parameters, Independent strong domination in complementary prisms, The geodetic domination number of comb product graphs, Degree equitable restrained double domination in graphs, Connected domination value in graphs, The signed Roman domination number of two classes graphs, Double domination in signed graphs, Irredundance, Domination and Total Domination in Hypergraphs, Domination in Digraphs, Algorithms and Complexity of Signed, Minus, and Majority Domination, Fair reception and Vizing's conjecture, Hardness, Approximability, and Exact Algorithms for Vector Domination and Total Vector Domination in Graphs, ANOTHER LOOK AT k-DOMINATION IN GRAPHS, Closed formulas for the total Roman domination number of lexicographic product graphs, Total $k$-Rainbow domination numbers in graphs, Linear-time algorithm for the matched-domination problem in cographs, An optimal algorithm to find minimum k-hop connected dominating set of permutation graphs, Effect of vertex-removal on game total domination numbers, Effect of an edge subdivision on game domination numbers, Total Roman domination in digraphs, Unnamed Item, Unnamed Item, Unnamed Item, Unnamed Item, (k,l)-kernels in line digraphs, Unnamed Item, The signed Roman domatic number of a digraph, Bounds on weak and strong total domination in graphs, On the nonnegative signed domination numbers in graphs, Open-independent, open-locating-dominating sets, Doubly connected bi-domination in graphs, Upper bounds for the forgotten topological index of graphs with given domination number, Total pitchfork domination and its inverse in graphs, On strict strong coloring of graphs, On trees with domination number equal to edge-vertex roman domination number, Majority bad number, On graphs whose domination numbers equal their independent domination numbers, On maximum number of minimal dominating sets in graphs, Double outer-independent domination number of graphs, Bounds on the domination number of a digraph and its reverse, Double hop dominating sets in graphs, Majority Roman domination in graphs, Independent domination in signed graphs, Total domination in cubic Knodel graphs, PBIB Designs and Their Association Schemes Arising from Minimum Bi-Independent Dominating Sets of Circulant Graphs, Weak Signed Roman Domination in Digraphs, Disjunctive domination in graphs with minimum degree at least two, On the domination number of $t$-constrained de Bruijn graphs, Relating the super domination and 2-domination numbers in cactus graphs, On domination in signed graphs, On the computation of extremal trees of Harmonic index with given edge-vertex domination number, Domination versus independent domination in regular graphs, On construction for trees making the equality hold in Vizing's conjecture, Domination in digraphs and their direct and Cartesian products, On the average lower bondage number of graphs under join and corona operations, Double domination in rooted product graphs, Isolation of connected graphs, A sharp upper bound on the cycle isolation number of graphs, On Hosoya Index and Merrifield‐Simmons Index of trees with given domination number, Partial domination and irredundance numbers in graphs, Independent 2-point set domination in graphs - II, Total mixed domination in graphs, Complexity of paired domination in at-free and planar graphs, An iterated greedy algorithm for finding the minimum dominating set in graphs, On global defensive k-alliances in zero-divisor graphs of finite commutative rings, Connected domination in random graphs, A linear-time algorithm for semitotal domination in strongly chordal graphs, Extended formulations for perfect domination problems and their algorithmic implications, Algorithmic Aspects of Outer-Independent Total Roman Domination in Graphs, Rainbow domination regular graphs that are not vertex transitive, Complexity aspects of restrained Roman domination in graphs, Some results on majority bad number, Computational aspects of double dominating sequences in graphs, Restrained {2}-domination in graphs, EXISTENCE OF LATIN SQUARE DESIGNS ARISING FROM CLASSICAL GRAPH PARAMETERS B. CHALUVARAJU AND SHAIKH AMEER BASHA, Weak signed Roman k-domination in digraphs, Applying the (1,2)-pitchfork domination and it's inverse on some special graphs, Total \(k\)-domination in Cartesian product of complete graphs, \( [ 1 , 2 \)-dimension of graphs], γ-Paired dominating graphs of lollipop, umbrella and coconut graphs, TOTAL DOMINATION INTEGRITY OF WHEEL RELATED GRAPHS, THE GLOBAL EQUITABLE DOMINATION IN GRAPHS, Total dominator coloring number of middle graphs, Secure equitability in graphs, Global dominating broadcast in graphs, Line-set domination in graphs, Inverse double Roman domination in graphs, An improved upper bound on the domination number of a tree, Some modified types of pitchfork domination and it's inverse, Nordhaus-Gaddum-type results on the connected edge domination number, Unnamed Item, Unnamed Item, Unnamed Item, Unnamed Item, Unnamed Item, Unnamed Item, Unnamed Item, Hardness results of global Roman domination in graphs, Algorithmic aspects of certified domination in graphs, Algorithmic Aspects of Quasi-Total Roman Domination in Graphs, Polynomial time algorithm for \(k\)-vertex-edge dominating problem in interval graphs, Total double Roman domination in graphs, A new lower bound on the total domination number of a graph, Enumeration of Maximal Irredundant Sets for Claw-Free Graphs, Double domination and super domination in trees, A linear Vizing‐like relation relating the size and total domination number of a graph, 2-RESERVED DOMINATION NUMBER OF GRAPHS, INVERSE MINUS DOMINATION IN GRAPHS, Approximating the Spanning k-Tree Forest Problem, Protection of graphs with emphasis on Cartesian product graphs, Total domination number of middle graphs, Notes on Latin square graphs and their domination numbers, Cartesian product graphs and k-tuple total domination, The adjacency dimension of graphs, NP-completeness of the independent dominating set problem in the class of cubic planar bipartite graphs, Coefficient of domination in graph, Further results on the independent Roman domination number of graphs, On the double total dominator chromatic number of graphs, A note on global dominator coloring of graphs, Algorithmic aspects of outer independent Roman domination in graphs, Graphs with equal domination and certified domination numbers, Connected Fair Domination in Graphs, Unnamed Item, On the signed domination number of some Cayley graphs, Double vertex-edge domination, Infinite graphs with finite dominating sets, DOMINATION AND EDGE DOMINATION IN TREES, Semitotal domination in claw-free cubic graphs, Exponential Independence Number of Some Graphs, An upper bound on the double Roman domination number, Randomized greedy algorithms for finding smallk-dominating sets of regular graphs, Some 3‐connected 4‐edge‐critical non‐Hamiltonian graphs, On -domination in graphs, Certified domination, Independent point-set dominating sets in graphs, Domatically perfect graphs, Lower bounds on nonnegative signed domination parameters in graphs, Semitotal domination in claw-free cubic graphs, k-tuple restrained domination in graphs, DOMINATION NUMBER IN THE ANNIHILATING-SUBMODULE GRAPH OF MODULES OVER COMMUTATIVE RINGS, A note on some parameters of domination on the edge neighborhood graph of a graph, Hardness results of global total \(k\)-domination problem in graphs, Relating ordinary and total domination in cubic graphs of large girth, On maximal Roman domination in graphs, On Approximating (Connected) 2-Edge Dominating Set by a Tree, On restricted domination in graphs, Power domination in planar graphs with small diameter, On the complexity of the outer-connected bondage and the outer-connected reinforcement problems, Complementary total domination in graphs, Domination in distance-hereditary graphs, Enumeration and maximum number of maximal irredundant sets for chordal graphs, Total dominator chromatic number of a graph, Signed Roman edge domination numbers in graphs, Power domination with bounded time constraints, \(k\)-power domination in block graphs, A note on the \(k\)-tuple total domination number of a graph, CKI-digraphs, generalized sums and partitions of digraphs, The existence problem of \(k\mathrm{-}\gamma_t\)-critical graphs, NP-completeness results for partitioning a graph into total dominating sets, Dominating functions with integer values in graphs—a survey, The strong domination problem in block graphs and proper interval graphs, Complexity and algorithms for semipaired domination in graphs, Unnamed Item, Unnamed Item, Unnamed Item, A characterization of graphs with disjoint total dominating sets, Linear separation of connected dominating sets in graphs, Unnamed Item, Unnamed Item, Domination versus disjunctive domination in graphs, A constructive characterization of trees with equal total domination and disjunctive domination numbers, Unnamed Item, Unnamed Item, Partitioning the Vertices of a Graph into Two Total Dominating Sets, A note on lower bounds for the total domination number of digraphs, A characterization of 3-i-critical graphs of connectivity two, INDEPENDENT AND IRREDUNDANT CYCLE TRACKING SETS OF A GRAPH: AN EFFICIENT APPROACH TO ELECTRICAL CIRCUIT ANALYSIS, Unnamed Item, Unnamed Item, The Dominating Set Problem in Geometric Intersection Graphs, On the intersection graph of gamma sets in the zero-divisor graph, The differential of the strong product graphs, All My Favorite Conjectures Are Critical, My Favorite Domination Conjectures in Graph Theory Are Bounded, Total Transversals in Hypergraphs and Their Applications, Critical concept for double Roman domination in graphs, The minimum eccentric distance sum of trees with given distance k-domination number, The integer {k}-domination number of circulant graphs, Independent strong weak domination: A mathematical programming approach, Outer-paired domination in graphs, Captive domination in graphs, Strong nonsplit dominating sets and strong nonsplit domination polynomial of complement of paths, On domination number of Latin square graphs of finite cyclic groups, A lower bound on the total vertex-edge domination number of a tree, Domination in signed graphs, Vertex criticality with respect to isolate domination, Algorithmic complexity of weakly connected Roman domination in graphs, Global Vertex-Edge Domination Sets in Total Graph and Product Graph of Path Pn Cycle Cn, A New Characterization of Paired Domination Number of a Graph, Domatically full Cartesian product graphs, On Congruent Domination Number of Disjoint and One Point Union of Graphs
