Graph-theoretic parameters concerning domination, independence, and irredundance

Cited in

(only showing first 100 items - show all)

NP-completeness results for partitioning a graph into total dominating sets
Construction of trees and graphs with equal domination parameters
Inequalities involving independence domination, f-domination, connected and total f-domination numbers
Distance domination in graphs
Rectangles as sums of squares
On matching and semitotal domination in graphs
Matching edges and faces in polygonal partitions
Domination-complete graphs
Alignment networks and electrical networks
THE PARALLEL ALGORITHMS FOR DETERMINING EDGE-PACKING AND EFFICIENT EDGE DOMINATING SETS IN INTERVAL GRAPHS
A Survey of the Game “Lights Out!”
Domination number and Laplacian eigenvalue distribution
A note on the \(P_3\)-isolation number of a graph
Laplacian distribution and domination
On the spectrum and number of convex sets in graphs
Trees, taxonomy, and strongly compatible multi-state characters
Irredundance
On the ratios between packing and domination parameters of a graph
\([1,2]\)-sets in graphs
A note on the irredundance number after vertex deletion
Star partitions on graphs
Upper bounds on the edge clique cover number of a graph
On matching and total domination in graphs
Irredundance number versus domination number
Dominating and irredundant broadcasts in graphs
EXTREMUM AGGREGATES OF MINIMAL 0-DOMINATING FUNCTIONS OF GRAPHS
Domination, eternal domination, and clique covering
The rati of the irredundance and domination number of a graph
Stratification and domination in graphs. II
Survey of facial results for the traveling salesman polytope
The sequence of upper and lower domination, independence and irredundance numbers of a graph
Some improved inequalities related to Vizing's conjecture
On minimum maximal independent sets of a graph
Spanning cycles in regular matroids without \(M^{*}(K_{5})\) minors
On the sum of two parameters concerning independence and irredundance in a graph
A characterization of well-dominated Cartesian products
On well-dominated direct, Cartesian and strong product graphs
Well irredundant graphs
Private domination number of a graph
Contributions to the theory of domination, independence and irredundance in graphs
The ratio of the distance irredundance and domination numbers of a graph
A note on total domination
Isoperimetric inequalities and Markov chains
Near-optimal, distributed edge colouring via the nibble method
On the weak Roman domination number of lexicographic product graphs
Relating ordinary and total domination in cubic graphs of large girth
A graph theoretic proof of the fundamental trace identity
Graphs with maximum size and given paired-domination number
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} \)
Large random graphs in pseudo-metric spaces
Independent domination in chordal graphs
An algorithm to check the equality of total domination number and double of domination number in graphs
Chordal graphs and upper irredundance, upper domination and independence
Fundamentals of planar ordered sets
An upper bound for the independent domination number
New bounds for the broadcast domination number of a graph
Restrained domination in self-complementary graphs
scientific article; zbMATH DE number 1507962 (Why is no real title available?)
Extremal connected graphs for independent domination number
Minimum degree and minimum number of edge-disjoint trees
Irredundancy in circular arc graphs
Cores of simplicial complexes
A survey of selected recent results on total domination in graphs
When an optimal dominating set with given constraints exists
The diversity of domination
On \(\alpha_{r}\gamma_{s}(k)\)-perfect graphs
Bibliography on domination in graphs and some basic definitions of domination parameters
Domination and irredundance in cubic graphs
MAXIMUM INDEPENDENT, MINIMALLY REDUNDANT SETS IN SERIES-PARALLEL GRAPHS
On upper transversals in 3-uniform hypergraphs
The Erdös-Sós conjecture for graphs of girth 5
An \(O(n\log n)\) algorithm for finding dissimilar strings
NP-completeness of the independent dominating set problem in the class of cubic planar bipartite graphs
Dominating sets inducing large components
Claw-free graphs---a survey
Total \([1,2]\)-domination in graphs
Distance irredundance and connected domination numbers of a graph
Irredundance perfect graphs
On automorphism groups of circulant digraphs of square-free order
On the independent domination number of graphs with given minimum degree
The difference between the metric dimension and the determining number of a graph
Total domination versus domination in cubic graphs
Domination and total domination in cubic graphs of large girth
Zero forcing versus domination in cubic graphs
Perfectly relating the domination, total domination, and paired domination numbers of a graph
1-Triangle graphs and perfect neighborhood sets
Partitioning the vertices of a cubic graph into two total dominating sets
Conical and spherical graphs
Inequalities between the \(K_k\)-isolation number and the independent \(K_k\)-isolation number of a graph
Graphs with equal domination and independent domination numbers
Dominating sets for split and bipartite graphs
On graphs with equal domination and 2-domination numbers
Some inequalities about connected domination number
Domination in fuzzy incidence graphs based on valid edges
Towards a new framework for domination
Unique irredundance, domination and independent domination in graphs
On the complexity landscape of the domination chain
Enumeration and maximum number of maximal irredundant sets for chordal graphs
On distance spectral radius of 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)