Graph-theoretic parameters concerning domination, independence, and irredundance

Cited in

(only showing first 100 items - show all)

Domination, eternal domination, and clique covering
When an optimal dominating set with given constraints exists
Domination in fuzzy incidence graphs based on valid edges
Inequalities between the \(K_k\)-isolation number and the independent \(K_k\)-isolation number of a graph
Laplacian distribution and domination
Models of domination in graphs
A note on the \(P_3\)-isolation number of a graph
On a theorem of Wielandt and the compounds of unitary matrices
Near-optimal, distributed edge colouring via the nibble method
Rectangles as sums of squares
NP-completeness of the independent dominating set problem in the class of cubic planar bipartite graphs
On upper transversals in 3-uniform hypergraphs
On automorphism groups of circulant digraphs of square-free order
Total Roman \(\{2\}\)-dominating functions in graphs
EXTREMUM AGGREGATES OF MINIMAL 0-DOMINATING FUNCTIONS OF GRAPHS
Protection of lexicographic product graphs
Enumeration and maximum number of maximal irredundant sets for chordal graphs
Graph coloring satisfying restraints
The number of cutvertices in graphs with given minimum degree
1-Triangle graphs and perfect neighborhood sets
MAXIMUM INDEPENDENT, MINIMALLY REDUNDANT SETS IN SERIES-PARALLEL GRAPHS
Restrained domination in self-complementary graphs
Survey of facial results for the traveling salesman polytope
Alignment networks and electrical networks
Total vertex-edge domination
Domination parameters of the unitary Cayley graph of \(\mathbb{Z}/n \mathbb{Z} \)
Domination chain: characterisation, classical complexity, parameterised complexity and approximability
Zero forcing versus domination in cubic graphs
Star partitions on graphs
Domination, independence and irredundance with respect to additive induced-hereditary prop\-erties
Graphs with maximum size and given paired-domination number
Clustering based on multiple paths
An algorithm to check the equality of total domination number and double of domination number in graphs
Stratification and domination in graphs. II
On the independent domination number of graphs with given minimum degree
A note on acyclic domination number in graphs of diameter two
A Survey of the Game “Lights Out!”
Some improved inequalities related to Vizing's conjecture
Extremal connected graphs for independent domination number
Minimum degree and minimum number of edge-disjoint trees
A graph theoretic proof of the fundamental trace identity
Private domination number of a graph
Irredundance
Computational complexity aspects of super domination
Domination-complete graphs
Partial domination and irredundance numbers in graphs
Partial domination in supercubic graphs
Graphs with equal domination and independent domination numbers
Vertex-connectivity, chromatic number, domination number, maximum degree and Laplacian eigenvalue distribution
A Roman domination chain
Dominating sets inducing large components
A note on isolate domination
Graphs with unique minimum edge dominating sets and graphs with unique maximum independent sets of vertices
A characterization of well-dominated Cartesian products
Partitioning the vertices of a cubic graph into two total dominating sets
Bounds on domination parameters in graphs: a brief survey
On well-dominated direct, Cartesian and strong product graphs
THE PARALLEL ALGORITHMS FOR DETERMINING EDGE-PACKING AND EFFICIENT EDGE DOMINATING SETS IN INTERVAL GRAPHS
Eternal and Secure Domination in Graphs
Some inequalities about connected domination number
On distance spectral radius of graphs
Irredundancy in circular arc graphs
On minimum maximal independent sets of a graph
Automated generation of conjectures on forbidden subgraph characterization
Matching edges and faces in polygonal partitions
Breaking the \(2^{n}\)-barrier for irredundance: two lines of attack
A note on total domination
Isoperimetric inequalities and Markov chains
Worldline Green functions for arbitrary Feynman diagrams
Inequalities involving independence domination, f-domination, connected and total f-domination numbers
Domination number and Laplacian eigenvalue distribution
Domination and location in twin-free digraphs
\([1,2]\)-sets in graphs
Total \([1,2]\)-domination in graphs
Cores of simplicial complexes
Contributions to the theory of domination, independence and irredundance in graphs
A survey of selected recent results on total domination in graphs
Claw-free graphs---a survey
On the spectrum and number of convex sets in graphs
Farrell polynomials on graphs of bounded tree width
New bounds for the broadcast domination number of a graph
On the ratios between packing and domination parameters of a graph
The Erdös-Sós conjecture for graphs of girth 5
On well-dominated graphs
Irredundance perfect graphs
Combinatorial analysis (nonnegative matrices, algorithmic problems)
Irredundance number versus domination number
Unique irredundance, domination and independent domination in graphs
Two relations between the parameters of independence and irredundance
Graphs with equal eternal vertex cover and eternal domination numbers
Conical and spherical graphs
Efficient edge domination problems in graphs
Distance domination in graphs
Towards a new framework for domination
On graphs with equal domination and 2-domination numbers
On the complexity landscape of the domination chain
A note on the irredundance number after vertex deletion
The diversity of domination
On matching and total domination in graphs
Construction of trees and graphs with equal domination parameters

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)