Graph-theoretic parameters concerning domination, independence, and irredundance

Cited in

(only showing first 100 items - show all)

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
Distance irredundance and connected domination numbers of a graph
Perfectly relating the domination, total domination, and paired domination numbers of a graph
On the sum of two parameters concerning independence and irredundance in a graph
The sequence of upper and lower domination, independence and irredundance numbers of a graph
Well irredundant graphs
Packing of \(K_{v}\) with certain graphs of five vertices
A constructive proof of Vizing's theorem
scientific article; zbMATH DE number 1507962 (Why is no real title available?)
Relating ordinary and total domination in cubic graphs of large girth
Domination and total domination in cubic graphs of large girth
The rati of the irredundance and domination number of a graph
On independent domination number of regular graphs
Shortest paths in distance-regular graphs
Fundamentals of planar ordered sets
Dominating sets and domatic number of circular arc graphs
Dominating sets for split and bipartite graphs
Matchings, path covers and domination
On \(\alpha_{r}\gamma_{s}(k)\)-perfect graphs
The ratio of the distance irredundance and domination numbers of a graph
Upper bounds on the edge clique cover number of a graph
An upper bound for the independent domination number
Chordal graphs and upper irredundance, upper domination and independence
Dominating and irredundant broadcasts in graphs
Total domination versus domination in cubic graphs
Domination and irredundance in cubic graphs
A note on non-dominating set partitions in graphs
An \(O(n\log n)\) algorithm for finding dissimilar strings
The difference between the metric dimension and the determining number of a graph
Locating-dominating sets in twin-free graphs
Large random graphs in pseudo-metric spaces
Trees, taxonomy, and strongly compatible multi-state characters
NP-completeness results for partitioning a graph into total dominating sets
On matching and semitotal domination in graphs
On the weak Roman domination number of lexicographic product graphs
Paired domination in graphs
Bibliography on domination in graphs and some basic definitions of domination parameters
Independent domination in chordal graphs
Spanning cycles in regular matroids without \(M^{*}(K_{5})\) minors
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

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)