On domination and independent domination numbers of a graph
From MaRDI portal
Publication:754234
DOI10.1016/0012-365X(78)90105-XzbMath0416.05064OpenAlexW1995459638WikidataQ105824535 ScholiaQ105824535MaRDI QIDQ754234
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
Related Items
On claw-free asteroidal triple-free graphs, Some results on an intersection graph of a topology, 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, The domination number and the least \(Q\)-eigenvalue, EQUITABLE DOMINATION IN GRAPHS, Index of parameters of iterated line graphs, Minimum maximal matchings in cubic graphs, Irredundance perfect graphs, Domination in graphoidally covered graphs: least-kernel graphoidal graphs. II, Strong weak domination and domination balance in a graph, Domination and irredundance in cubic graphs, On weakly connected domination in graphs, Claw-free graphs---a survey, One-node cutsets and the dominating set polytope, Domination in graphoidally covered graphs: least-kernel graphoidal covers, Inequalities involving independence domination, f-domination, connected and total f-domination numbers, Adding isolated vertices makes some greedy online algorithms optimal, ON WEAK DOMINATION NUMBER OF SOME GRAPHS, SOME RESULTS ON WEAK DOMINATION IN GRAPHS, Vizing's conjecture: A two-thirds bound for claw-free graphs, APPROXIMATION ALGORITHMS FOR A VARIANT OF DISCRETE PIERCING SET PROBLEM FOR UNIT DISKS, Using maximality and minimality conditions to construct inequality chains, Domination chain: characterisation, classical complexity, parameterised complexity and approximability, Vizing's conjecture for graphs with domination number 3 -- a new proof, Independent domination, colorings and the fractional idomatic number of a graph, Categorifying connected domination via graph überhomology, On non-progressive spread of influence through social networks, On independent domination in direct products, Smallest maximal matchings of graphs, Domination number and feedback vertex number of complements of line graphs, The Outer-Paired Domination of Graphs, \([1,2\)-sets and \([1,2]\)-total sets in trees with algorithms], Domination versus edge domination, On linear and circular structure of (claw, net)-free graphs, Common domination perfect graphs, Breaking the \(2^{n}\)-barrier for irredundance: two lines of attack, Construction of trees and graphs with equal domination parameters, Contributions to the theory of domination, independence and irredundance in graphs, On the vertices belonging to all, some, none minimum dominating set, Conical and spherical graphs, Unnamed Item, \([1,2\)-sets in graphs], On the semitotal domination number of line graphs, ON SOME TOTAL GRAPHS ON FINITE RINGS, Unnamed Item, Chordal graphs and upper irredundance, upper domination and independence, \(k\)-domination and \(k\)-independence in graphs: A survey, Common point domination number, Unnamed Item, On graphs with equal domination and independent domination numbers, Domination When the Stars Are Out, A note on an induced subgraph characterization of domination perfect graphs, Cores of simplicial complexes, The independent domination number of a cubic 3-connected graph can be much larger than its domination number, The \(v\)-number of edge ideals, Unnamed Item, Domination critical graphs, Intersection graphs of non-crossing paths, Critical concepts in domination, On graph fall-coloring: existence and constructions, On the domination numbers of generalized de Bruijn digraphs and generalized Kautz digraphs, Bounds on weak Roman and 2-rainbow domination numbers, Automated generation of conjectures on forbidden subgraph characterization, Total domination in graphs, Multiple Domination, Distance Domination in Graphs, Domination-complete graphs, A \(\frac{3}{4}\)-approximation of Vizing's conjecture for claw-free graphs, Unnamed Item, Introducing \textsf{lop}-kernels: a framework for kernelization lower bounds, Dominating sets for split and bipartite graphs, Graphs with equal domination and independent domination numbers, Unique irredundance, domination and independent domination in graphs, Graphs with unique minimum edge dominating sets and graphs with unique maximum independent sets of vertices, RELATIONSHIP BETWEEN BLOCK DOMINATION PARAMETERS OF A GRAPH, Some results of inclusion graph of a topology, What is the difference between the domination and independent domination numbers of a cubic graph?, Dominating sets and domatic number of circular arc graphs, Bibliography on domination in graphs and some basic definitions of domination parameters, Independent domination in signed graphs
Cites Work
