Graph-theoretic parameters concerning domination, independence, and irredundance

Cited In (only showing first 100 items - show all)

Distance Domination in Graphs
Contributions to the theory of domination, independence and irredundance in graphs
A note on total domination
Isoperimetric inequalities and Markov chains
Relating ordinary and total domination in cubic graphs of large girth
On the weak Roman domination number of lexicographic product graphs
Large random graphs in pseudo-metric spaces
Independent domination in chordal graphs
Fundamentals of planar ordered sets
An upper bound for the independent domination number
Chordal graphs and upper irredundance, upper domination and independence
New bounds for the broadcast domination number of a graph
Title not available (Why is that?)
Irredundancy in circular arc graphs
Cores of simplicial complexes
A survey of selected recent results on total domination in graphs
The diversity of domination
On \(\alpha_{r}\gamma_{s}(k)\)-perfect graphs
Domination and irredundance in cubic graphs
Bibliography on domination in graphs and some basic definitions of domination parameters
The Erdös-Sós conjecture for graphs of girth 5
An \(O(n\log n)\) algorithm for finding dissimilar strings
Total \([1,2]\)-domination in graphs
Claw-free graphs---a survey
Irredundance perfect graphs
Distance irredundance and connected domination numbers of a graph
Total domination versus domination in cubic graphs
The difference between the metric dimension and the determining number of a graph
Perfectly relating the domination, total domination, and paired domination numbers of a graph
Domination and total domination in cubic graphs of large girth
Conical and spherical graphs
On graphs with equal domination and 2-domination numbers
Dominating sets for split and bipartite graphs
Some inequalities about connected domination number
Unique irredundance, domination and independent domination in graphs
On the complexity landscape of the domination chain
Towards a new framework for domination
Eternal and Secure Domination in Graphs
On distance spectral radius of graphs
Combinatorial analysis (nonnegative matrices, algorithmic problems)
Shortest paths in distance-regular graphs
Breaking the \(2^{n}\)-barrier for irredundance: two lines of attack
Worldline Green functions for arbitrary Feynman diagrams
Graphs with equal eternal vertex cover and eternal domination numbers
Automated generation of conjectures on forbidden subgraph characterization
Two relations between the parameters of independence and irredundance
Matchings, path covers and domination
Packing of \(K_{v}\) with certain graphs of five vertices
On independent domination number of regular graphs
Dominating sets and domatic number of circular arc graphs
A note on non-dominating set partitions in graphs
Locating-dominating sets in twin-free graphs
Efficient edge domination problems in graphs
NP-completeness results for partitioning a graph into total dominating sets
Inequalities involving independence domination, f-domination, connected and total f-domination numbers
Domination and location in twin-free digraphs
Farrell polynomials on graphs of bounded tree width
On well-dominated graphs
Construction of trees and graphs with equal domination parameters
A constructive proof of Vizing's theorem
On matching and semitotal domination in graphs
Matching edges and faces in polygonal partitions
THE PARALLEL ALGORITHMS FOR DETERMINING EDGE-PACKING AND EFFICIENT EDGE DOMINATING SETS IN INTERVAL GRAPHS
Domination number and Laplacian eigenvalue distribution
On the spectrum and number of convex sets in graphs
Trees, taxonomy, and strongly compatible multi-state characters
\([1,2]\)-sets in graphs
On the ratios between packing and domination parameters of a graph
A note on the irredundance number after vertex deletion
On matching and total domination in graphs
Upper bounds on the edge clique cover number of a graph
Irredundance number versus domination number
Dominating and irredundant broadcasts in graphs
The rati of the irredundance and domination number of a graph
The sequence of upper and lower domination, independence and irredundance numbers of a graph
Spanning cycles in regular matroids without \(M^{*}(K_{5})\) minors
On minimum maximal independent sets of a graph
On the sum of two parameters concerning independence and irredundance in a graph
Paired Domination in Graphs
Well irredundant graphs
The ratio of the distance irredundance and domination numbers of a graph
Near-optimal, distributed edge colouring via the nibble method
Graphs with maximum size and given paired-domination number
A graph theoretic proof of the fundamental trace identity
Vertex-connectivity, chromatic number, domination number, maximum degree and Laplacian eigenvalue distribution
Domination parameters of the unitary Cayley graph of \(\mathbb{Z}/n \mathbb{Z} \)
An algorithm to check the equality of total domination number and double of domination number in graphs
Restrained domination in self-complementary graphs
Extremal connected graphs for independent domination number
Minimum degree and minimum number of edge-disjoint trees
When an optimal dominating set with given constraints exists
MAXIMUM INDEPENDENT, MINIMALLY REDUNDANT SETS IN SERIES-PARALLEL GRAPHS
NP-completeness of the independent dominating set problem in the class of cubic planar bipartite graphs
On upper transversals in 3-uniform hypergraphs
Dominating sets inducing large components
Title not available (Why is that?)
On automorphism groups of circulant digraphs of square-free order
On the independent domination number of graphs with given minimum degree
1-Triangle graphs and perfect neighborhood sets
Zero forcing versus domination in cubic graphs

This page was built for publication: Graph-theoretic parameters concerning domination, independence, and irredundance

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3208702)