Graph-theoretic parameters concerning domination, independence, and irredundance
From MaRDI portal
Publication:3208702
DOI10.1002/jgt.3190030306zbMath0418.05049OpenAlexW1997787124MaRDI QIDQ3208702
Publication date: 1979
Published in: Journal of Graph Theory (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1002/jgt.3190030306
Related Items
Total \([1,2\)-domination in graphs], Domination, independence and irredundance with respect to additive induced-hereditary prop\-erties, Fundamentals of planar ordered sets, An \(O(n\log n)\) algorithm for finding dissimilar strings, On upper transversals in 3-uniform hypergraphs, Stratification and domination in graphs. II, The difference between the metric dimension and the determining number of a graph, A graph theoretic proof of the fundamental trace identity, On the sum of two parameters concerning independence and irredundance in a graph, Domination in fuzzy incidence graphs based on valid edges, Irredundance perfect graphs, Two relations between the parameters of independence and irredundance, The diversity of domination, Domination and irredundance in cubic graphs, Claw-free graphs---a survey, Bounds on domination parameters in graphs: a brief survey, Total Roman \(\{2\}\)-dominating functions in graphs, Matchings, path covers and domination, A note on non-dominating set partitions in graphs, Distance irredundance and connected domination numbers of a graph, Trees, taxonomy, and strongly compatible multi-state characters, The Erdös-Sós conjecture for graphs of girth 5, Well irredundant graphs, The rati of the irredundance and domination number of a graph, Some inequalities about connected domination number, Worldline Green functions for arbitrary Feynman diagrams, Domination chain: characterisation, classical complexity, parameterised complexity and approximability, Laplacian distribution and domination, Domination and total domination in cubic graphs of large girth, On the weak Roman domination number of lexicographic product graphs, When an optimal dominating set with given constraints exists, Farrell polynomials on graphs of bounded tree width, Domination number and Laplacian eigenvalue distribution, On \(\alpha_{r}\gamma_{s}(k)\)-perfect graphs, On distance spectral radius of graphs, Locating-dominating sets in twin-free graphs, Breaking the \(2^{n}\)-barrier for irredundance: two lines of attack, Construction of trees and graphs with equal domination parameters, Graph coloring satisfying restraints, Contributions to the theory of domination, independence and irredundance in graphs, Total domination versus domination in cubic graphs, The number of cutvertices in graphs with given minimum degree, Some improved inequalities related to Vizing's conjecture, Conical and spherical graphs, New bounds for the broadcast domination number of a graph, On matching and semitotal domination in graphs, Minimum degree and minimum number of edge-disjoint trees, Extremal connected graphs for independent domination number, Clustering based on multiple paths, Inequalities between the \(K_k\)-isolation number and the independent \(K_k\)-isolation number of a graph, Towards a new framework for domination, \([1,2\)-sets in graphs], Independent domination in chordal graphs, Graphs with maximum size and given paired-domination number, Chordal graphs and upper irredundance, upper domination and independence, Irredundance number versus domination number, Shortest paths in distance-regular graphs, Vertex-connectivity, chromatic number, domination number, maximum degree and Laplacian eigenvalue distribution, Restrained domination in self-complementary graphs, On minimum maximal independent sets of a graph, Spanning cycles in regular matroids without \(M^{*}(K_{5})\) minors, A constructive proof of Vizing's theorem, Dominating and irredundant broadcasts in graphs, Irredundancy in circular arc graphs, Cores of simplicial complexes, Packing of \(K_{v}\) with certain graphs of five vertices, Star partitions on graphs, Graphs with equal eternal vertex cover and eternal domination numbers, Zero forcing versus domination in cubic graphs, Partitioning the vertices of a cubic graph into two total dominating sets, A survey of selected recent results on total domination in graphs, Automated generation of conjectures on forbidden subgraph characterization, Large random graphs in pseudo-metric spaces, Domination-complete graphs, On the ratios between packing and domination parameters of a graph, Protection of lexicographic product graphs, Near-optimal, distributed edge colouring via the nibble method, Domination and location in twin-free digraphs, Rectangles as sums of squares, On the independent domination number of graphs with given minimum degree, On independent domination number of regular graphs, On well-dominated direct, Cartesian and strong product graphs, Dominating sets for split and bipartite graphs, On the spectrum and number of convex sets in graphs, An upper bound for the independent domination number, Perfectly relating the domination, total domination, and paired domination numbers of a graph, Combinatorial analysis (nonnegative matrices, algorithmic problems), Upper bounds on the edge clique cover number of a graph, 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, Domination, eternal domination, and clique covering, Survey of facial results for the traveling salesman polytope, Isoperimetric inequalities and Markov chains, Efficient edge domination problems in graphs, The sequence of upper and lower domination, independence and irredundance numbers of a graph, A note on total domination, Domination parameters of the unitary Cayley graph of \(\mathbb{Z}/n \mathbb{Z} \), Dominating sets and domatic number of circular arc graphs, Bibliography on domination in graphs and some basic definitions of domination parameters, On a theorem of Wielandt and the compounds of unitary matrices, Dominating sets inducing large components, The ratio of the distance irredundance and domination numbers of a graph, Inequalities involving independence domination, f-domination, connected and total f-domination numbers, THE PARALLEL ALGORITHMS FOR DETERMINING EDGE-PACKING AND EFFICIENT EDGE DOMINATING SETS IN INTERVAL GRAPHS, MAXIMUM INDEPENDENT, MINIMALLY REDUNDANT SETS IN SERIES-PARALLEL GRAPHS, On well-dominated graphs, NP-completeness of the independent dominating set problem in the class of cubic planar bipartite graphs, An algorithm to check the equality of total domination number and double of domination number in graphs, Computational complexity aspects of super domination, Partial domination in supercubic graphs, Partial domination and irredundance numbers in graphs, A characterization of well-dominated Cartesian products, Unnamed Item, EXTREMUM AGGREGATES OF MINIMAL 0-DOMINATING FUNCTIONS OF GRAPHS, Private domination number of a graph, Unnamed Item, Matching edges and faces in polygonal partitions, Relating ordinary and total domination in cubic graphs of large girth, 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, Enumeration and maximum number of maximal irredundant sets for chordal graphs, On the Complexity Landscape of the Domination Chain, Alignment networks and electrical networks, A Roman domination chain, NP-completeness results for partitioning a graph into total dominating sets, Irredundance, Models of Domination in Graphs, Paired Domination in Graphs, Distance Domination in Graphs, Eternal and Secure Domination in Graphs, A Survey of the Game “Lights Out!”, On automorphism groups of circulant digraphs of square-free order, Graphs with equal domination and independent domination numbers, Unique irredundance, domination and independent domination in graphs, 1-Triangle graphs and perfect neighborhood sets, Total vertex-edge domination
