Pages that link to "Item:Q2785650"
From MaRDI portal
The following pages link to Associative graph products and their independence, domination and coloring numbers (Q2785650):
Displaying 41 items.
- Graph products of the trivariate total domination polynomial and related polynomials (Q298962) (← links)
- Connectivity and other invariants of generalized products of graphs (Q313405) (← links)
- On the roman domination in the lexicographic product of graphs (Q442220) (← links)
- Dominating sequences in grid-like and toroidal graphs (Q504964) (← links)
- Lower bounds for the domination number and the total domination number of direct product graphs (Q712256) (← links)
- Double domination in lexicographic product graphs (Q777395) (← links)
- Acyclic colorings of products of trees (Q845661) (← links)
- Dominating direct products of graphs (Q879339) (← links)
- Bondage number of strong product of two paths (Q893339) (← links)
- A survey of selected recent results on total domination in graphs (Q998491) (← links)
- On the acyclic chromatic number of Hamming graphs (Q1014824) (← links)
- On the total \(\{k\}\)-domination number of Cartesian products of graphs (Q1037451) (← links)
- Fractional dominations and fractional total dominations of graph complements (Q1613430) (← links)
- Domination and upper domination of direct product graphs (Q1660257) (← links)
- Gromov hyperbolicity in the Cartesian sum of graphs (Q1734079) (← links)
- \(k\)-tuple total domination in cross products of graphs (Q1928523) (← links)
- Complexity of \(k\)-rainbow independent domination and some results on the lexicographic product of graphs (Q2008916) (← links)
- Domination related parameters in the generalized lexicographic product of graphs (Q2030248) (← links)
- Tightness of domination inequalities for direct product graphs (Q2037578) (← links)
- On the 2-packing differential of a graph (Q2044595) (← links)
- Protection of lexicographic product graphs (Q2062678) (← links)
- On well-dominated direct, Cartesian and strong product graphs (Q2092407) (← links)
- On well-covered direct products (Q2118250) (← links)
- On maximum independent set of categorical product and ultimate categorical ratios of graphs (Q2348262) (← links)
- Bondage number of the strong product of two trees (Q2399299) (← links)
- Total Roman domination in the lexicographic product of graphs (Q2420413) (← links)
- On the super domination number of lexicographic product graphs (Q2420416) (← links)
- On the weak Roman domination number of lexicographic product graphs (Q2420431) (← links)
- On independent domination in direct products (Q2680574) (← links)
- Vizing's conjecture: a survey and recent results (Q3113279) (← links)
- Closed formulas for the total Roman domination number of lexicographic product graphs (Q3390051) (← links)
- Upper bounds on the bondage number of the strong product of a graph and a tree (Q4641566) (← links)
- Perfect Domination, Roman Domination and Perfect Roman Domination in Lexicographic Product Graphs (Q5075513) (← links)
- DOMINATION AND DOMATIC NUMBERS OF INVOLUTORY CAYLEY GRAPH (Q5076194) (← links)
- The total co-independent domination number of some graph operations (Q5101866) (← links)
- Independence number of generalized products of graphs (Q5213019) (← links)
- Smallest independent dominating sets in Kronecker products of cycles (Q5951974) (← links)
- On construction for trees making the equality hold in Vizing's conjecture (Q6057635) (← links)
- On some metric properties of direct-co-direct product (Q6096252) (← links)
- Unimodality and monotonic portions of certain domination polynomials (Q6098090) (← links)
- From \(w\)-domination in graphs to domination parameters in lexicographic product graphs (Q6102213) (← links)