On domination and independent domination numbers of a graph
From MaRDI portal
Publication:754234
DOI10.1016/0012-365X(78)90105-XzbMATH Open0416.05064OpenAlexW1995459638WikidataQ105824535 ScholiaQ105824535MaRDI QIDQ754234FDOQ754234
Authors: Robert B. Allan, Renu C. Laskar
Publication date: 1978
Published in: Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0012-365x(78)90105-x
Cites Work
Cited In (82)
- Pure Nash equilibriums and independent dominating sets in evolutionary games on networks
- Edge domination in intuitionistic fuzzy graphs
- Some results of inclusion graph of a topology
- Relationship between block domination parameters of a graph
- Domination parameters of the splitting graph of a graph
- Categorifying connected domination via graph überhomology
- Independent domination versus packing in subcubic graphs
- ON WEAK DOMINATION NUMBER OF SOME GRAPHS
- SOME RESULTS ON WEAK DOMINATION IN GRAPHS
- Independent domination in the graph defined by two consecutive levels of the \(n\)-cube
- Common domination perfect graphs
- Independent domination in signed graphs
- Equitable domination in graphs
- Common point domination number
- Construction of Halin graph with perfect k-ary tree and its independent domination number
- On independent domination parameters of some special families of Halin graph
- On graph fall-coloring: existence and constructions
- Domination number and feedback vertex number of complements of line graphs
- The Outer-Paired Domination of Graphs
- Domination versus edge domination
- APPROXIMATION ALGORITHMS FOR A VARIANT OF DISCRETE PIERCING SET PROBLEM FOR UNIT DISKS
- Title not available (Why is that?)
- On some total graphs on finite rings
- Contributions to the theory of domination, independence and irredundance in graphs
- On non-progressive spread of influence through social networks
- On graphs with equal domination and independent domination numbers
- Independent domination, colorings and the fractional idomatic number of a graph
- Smallest maximal matchings of graphs
- \(k\)-domination and \(k\)-independence in graphs: A survey
- Chordal graphs and upper irredundance, upper domination and independence
- The \(v\)-number of edge ideals
- Bounds on weak Roman and 2-rainbow domination numbers
- Title not available (Why is that?)
- Minimum maximal matchings in cubic graphs
- On claw-free asteroidal triple-free graphs
- Independent partial domination
- The domination number and the least \(Q\)-eigenvalue
- Cores of simplicial complexes
- Domination and irredundance in cubic graphs
- Bibliography on domination in graphs and some basic definitions of domination parameters
- Claw-free graphs---a survey
- On the domination numbers of generalized de Bruijn digraphs and generalized Kautz digraphs
- Irredundance perfect graphs
- On the vertices belonging to all, some, none minimum dominating set
- Domination critical graphs
- Graphs with equal domination and independent domination numbers
- Conical and spherical graphs
- Dominating sets for split and bipartite graphs
- Domination in graphoidally covered graphs: least-kernel graphoidal graphs. II
- On linear and circular structure of (claw, net)-free graphs
- Unique irredundance, domination and independent domination in graphs
- The independent domination number of a cubic 3-connected graph can be much larger than its domination number
- What is the difference between the domination and independent domination numbers of a cubic graph?
- Breaking the \(2^{n}\)-barrier for irredundance: two lines of attack
- Automated generation of conjectures on forbidden subgraph characterization
- Intersection graphs of non-crossing paths
- Domination chain: characterisation, classical complexity, parameterised complexity and approximability
- Domination in graphoidally covered graphs: least-kernel graphoidal covers
- Dominating sets and domatic number of circular arc graphs
- \([1,2]\)-sets and \([1,2]\)-total sets in trees with algorithms
- Graphs with unique minimum edge dominating sets and graphs with unique maximum independent sets of vertices
- Critical concepts in domination
- Some results on an intersection graph of a topology
- Inequalities involving independence domination, f-domination, connected and total f-domination numbers
- A \(\frac{3}{4}\)-approximation of Vizing's conjecture for claw-free graphs
- Distance domination in graphs
- Construction of trees and graphs with equal domination parameters
- Domination-complete graphs
- Vizing's conjecture: A two-thirds bound for claw-free graphs
- On weakly connected domination in graphs
- \([1,2]\)-sets in graphs
- One-node cutsets and the dominating set polytope
- Total domination in graphs
- Using maximality and minimality conditions to construct inequality chains
- Introducing \textsf{lop}-kernels: a framework for kernelization lower bounds
- On independent domination in direct products
- A note on an induced subgraph characterization of domination perfect graphs
- Multiple domination
- Vizing's conjecture for graphs with domination number 3 -- a new proof
- Strong weak domination and domination balance in a graph
- Index of parameters of iterated line graphs
- On the semitotal domination number of line graphs
This page was built for publication: On domination and independent domination numbers of a graph
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q754234)