Pages that link to "Item:Q3208702"

The following pages link to Graph-theoretic parameters concerning domination, independence, and irredundance (Q3208702):

Displaying 50 items.

• An \(O(n\log n)\) algorithm for finding dissimilar strings (Q290231) (← links)
• The difference between the metric dimension and the determining number of a graph (Q298637) (← links)
• Matchings, path covers and domination (Q329554) (← links)
• A note on non-dominating set partitions in graphs (Q339496) (← links)
• Domination and total domination in cubic graphs of large girth (Q400535) (← links)
• Conical and spherical graphs (Q444416) (← links)
• Dominating and irredundant broadcasts in graphs (Q507582) (← links)
• Breaking the \(2^{n}\)-barrier for irredundance: two lines of attack (Q635734) (← links)
• Towards a new framework for domination (Q651449) (← links)
• Irredundancy in circular arc graphs (Q686248) (← links)
• Packing of \(K_{v}\) with certain graphs of five vertices (Q698025) (← links)
• Automated generation of conjectures on forbidden subgraph characterization (Q741737) (← links)
• Large random graphs in pseudo-metric spaces (Q750268) (← links)
• Domination and location in twin-free digraphs (Q777359) (← links)
• Dominating sets for split and bipartite graphs (Q794174) (← links)
• Upper bounds on the edge clique cover number of a graph (Q799696) (← links)
• Bibliography on domination in graphs and some basic definitions of domination parameters (Q810066) (← links)
• Distance irredundance and connected domination numbers of a graph (Q860459) (← links)
• Worldline Green functions for arbitrary Feynman diagrams (Q881379) (← links)
• Domination number and Laplacian eigenvalue distribution (Q901155) (← links)
• Locating-dominating sets in twin-free graphs (Q906432) (← links)
• Graph coloring satisfying restraints (Q910410) (← links)
• The number of cutvertices in graphs with given minimum degree (Q912123) (← links)
• Cores of simplicial complexes (Q958242) (← links)
• A survey of selected recent results on total domination in graphs (Q998491) (← links)
• On the ratios between packing and domination parameters of a graph (Q1025506) (← links)
• Rectangles as sums of squares (Q1043649) (← links)
• Combinatorial analysis (nonnegative matrices, algorithmic problems) (Q1060220) (← links)
• Isoperimetric inequalities and Markov chains (Q1063327) (← links)
• A note on total domination (Q1065020) (← links)
• Dominating sets and domatic number of circular arc graphs (Q1066921) (← links)
• Fundamentals of planar ordered sets (Q1086596) (← links)
• A graph theoretic proof of the fundamental trace identity (Q1095925) (← links)
• On the sum of two parameters concerning independence and irredundance in a graph (Q1095940) (← links)
• Two relations between the parameters of independence and irredundance (Q1100217) (← links)
• Some inequalities about connected domination number (Q1126207) (← links)
• Contributions to the theory of domination, independence and irredundance in graphs (Q1157348) (← links)
• Clustering based on multiple paths (Q1167548) (← links)
• Independent domination in chordal graphs (Q1169487) (← links)
• Chordal graphs and upper irredundance, upper domination and independence (Q1174126) (← links)
• Irredundance number versus domination number (Q1176738) (← links)
• On minimum maximal independent sets of a graph (Q1182974) (← links)
• A constructive proof of Vizing's theorem (Q1186590) (← links)
• Near-optimal, distributed edge colouring via the nibble method (Q1274333) (← links)
• On independent domination number of regular graphs (Q1301709) (← links)
• An upper bound for the independent domination number (Q1306311) (← links)
• A note on the irredundance number after vertex deletion (Q1309448) (← links)
• Graphs with unique minimum edge dominating sets and graphs with unique maximum independent sets of vertices (Q1309472) (← links)
• Efficient edge domination problems in graphs (Q1313728) (← links)
• The sequence of upper and lower domination, independence and irredundance numbers of a graph (Q1313851) (← links)