Graph-theoretic parameters concerning domination, independence, and irredundance

Cited in

(only showing first 100 items - show all)

On the ratios between packing and domination parameters of a graph
Rectangles as sums of squares
Combinatorial analysis (nonnegative matrices, algorithmic problems)
Isoperimetric inequalities and Markov chains
A note on total domination
Dominating sets and domatic number of circular arc graphs
Fundamentals of planar ordered sets
A graph theoretic proof of the fundamental trace identity
On the sum of two parameters concerning independence and irredundance in a graph
Two relations between the parameters of independence and irredundance
Some inequalities about connected domination number
Contributions to the theory of domination, independence and irredundance in graphs
Clustering based on multiple paths
Independent domination in chordal graphs
Chordal graphs and upper irredundance, upper domination and independence
Irredundance number versus domination number
On minimum maximal independent sets of a graph
A constructive proof of Vizing's theorem
Near-optimal, distributed edge colouring via the nibble method
On independent domination number of regular graphs
An upper bound for the independent domination number
A note on the irredundance number after vertex deletion
Graphs with unique minimum edge dominating sets and graphs with unique maximum independent sets of vertices
Efficient edge domination problems in graphs
The sequence of upper and lower domination, independence and irredundance numbers of a graph
On a theorem of Wielandt and the compounds of unitary matrices
The diversity of domination
Domination and irredundance in cubic graphs
Claw-free graphs---a survey
Trees, taxonomy, and strongly compatible multi-state characters
The rati of the irredundance and domination number of a graph
Farrell polynomials on graphs of bounded tree width
On \(\alpha_{r}\gamma_{s}(k)\)-perfect graphs
Minimum degree and minimum number of edge-disjoint trees
Extremal connected graphs for independent domination number
On the independent domination number of graphs with given minimum degree
Survey of facial results for the traveling salesman polytope
Total \([1,2]\)-domination in graphs
On upper transversals in 3-uniform hypergraphs
Laplacian distribution and domination
Total domination versus domination in cubic graphs
Some improved inequalities related to Vizing's conjecture
Domination-complete graphs
Domination, independence and irredundance with respect to additive induced-hereditary prop\-erties
Stratification and domination in graphs. II
Irredundance perfect graphs
The Erdös-Sós conjecture for graphs of girth 5
Well irredundant graphs
On distance spectral radius of graphs
New bounds for the broadcast domination number of a graph
Shortest paths in distance-regular graphs
Star partitions on graphs
Zero forcing versus domination in cubic graphs
Partitioning the vertices of a cubic graph into two total dominating sets
Protection of lexicographic product graphs
On well-dominated direct, Cartesian and strong product graphs
Domination parameters of the unitary Cayley graph of \(\mathbb{Z}/n \mathbb{Z} \)
Domination in fuzzy incidence graphs based on valid edges
Bounds on domination parameters in graphs: a brief survey
Total Roman \(\{2\}\)-dominating functions in graphs
Domination chain: characterisation, classical complexity, parameterised complexity and approximability
Inequalities between the \(K_k\)-isolation number and the independent \(K_k\)-isolation number of a graph
Vertex-connectivity, chromatic number, domination number, maximum degree and Laplacian eigenvalue distribution
Restrained domination in self-complementary graphs
Graphs with equal eternal vertex cover and eternal domination numbers
On the spectrum and number of convex sets in graphs
Perfectly relating the domination, total domination, and paired domination numbers of a graph
Domination, eternal domination, and clique covering
On the weak Roman domination number of lexicographic product graphs
When an optimal dominating set with given constraints exists
Construction of trees and graphs with equal domination parameters
On matching and semitotal domination in graphs
\([1,2]\)-sets in graphs
Graphs with maximum size and given paired-domination number
Spanning cycles in regular matroids without \(M^{*}(K_{5})\) minors
Matching edges and faces in polygonal partitions
On graphs with equal domination and 2-domination numbers
On matching and total domination in graphs
A note on acyclic domination number in graphs of diameter two
On automorphism groups of circulant digraphs of square-free order
Unique irredundance, domination and independent domination in graphs
Dominating sets inducing large components
On well-dominated graphs
On the complexity landscape of the domination chain
A Survey of the Game “Lights Out!”
An \(O(n\log n)\) algorithm for finding dissimilar strings
The difference between the metric dimension and the determining number of a graph
Matchings, path covers and domination
Irredundance
Models of domination in graphs
Paired domination in graphs
Distance domination in graphs
Eternal and Secure Domination in Graphs
A note on non-dominating set partitions in graphs
Private domination number of a graph
Domination and total domination in cubic graphs of large girth
The ratio of the distance irredundance and domination numbers of a graph
MAXIMUM INDEPENDENT, MINIMALLY REDUNDANT SETS IN SERIES-PARALLEL GRAPHS
Conical and spherical graphs
scientific article; zbMATH DE number 1507962 (Why is no real title available?)

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)