Pages that link to "Item:Q754234"
From MaRDI portal
The following pages link to On domination and independent domination numbers of a graph (Q754234):
Displaying 50 items.
- The domination number and the least \(Q\)-eigenvalue (Q278336) (← links)
- Domination in graphoidally covered graphs: least-kernel graphoidal covers (Q327691) (← links)
- On non-progressive spread of influence through social networks (Q401306) (← links)
- Conical and spherical graphs (Q444416) (← links)
- A note on an induced subgraph characterization of domination perfect graphs (Q516908) (← links)
- Breaking the \(2^{n}\)-barrier for irredundance: two lines of attack (Q635734) (← links)
- \(k\)-domination and \(k\)-independence in graphs: A survey (Q659765) (← links)
- The independent domination number of a cubic 3-connected graph can be much larger than its domination number (Q687719) (← links)
- Bounds on weak Roman and 2-rainbow domination numbers (Q741531) (← links)
- Automated generation of conjectures on forbidden subgraph characterization (Q741737) (← links)
- A \(\frac{3}{4}\)-approximation of Vizing's conjecture for claw-free graphs (Q777412) (← links)
- Dominating sets for split and bipartite graphs (Q794174) (← links)
- What is the difference between the domination and independent domination numbers of a cubic graph? (Q804588) (← links)
- Bibliography on domination in graphs and some basic definitions of domination parameters (Q810066) (← links)
- Vizing's conjecture for graphs with domination number 3 -- a new proof (Q888596) (← links)
- \([1,2]\)-sets and \([1,2]\)-total sets in trees with algorithms (Q897596) (← links)
- Cores of simplicial complexes (Q958242) (← links)
- On the domination numbers of generalized de Bruijn digraphs and generalized Kautz digraphs (Q1007577) (← links)
- Dominating sets and domatic number of circular arc graphs (Q1066921) (← links)
- Contributions to the theory of domination, independence and irredundance in graphs (Q1157348) (← links)
- Chordal graphs and upper irredundance, upper domination and independence (Q1174126) (← links)
- On graphs with equal domination and independent domination numbers (Q1182987) (← links)
- Graphs with unique minimum edge dominating sets and graphs with unique maximum independent sets of vertices (Q1309472) (← links)
- Strong weak domination and domination balance in a graph (Q1356427) (← links)
- Domination and irredundance in cubic graphs (Q1356461) (← links)
- On weakly connected domination in graphs (Q1356466) (← links)
- Claw-free graphs---a survey (Q1356695) (← links)
- One-node cutsets and the dominating set polytope (Q1356733) (← links)
- Using maximality and minimality conditions to construct inequality chains (Q1377679) (← links)
- On linear and circular structure of (claw, net)-free graphs (Q1406025) (← links)
- On claw-free asteroidal triple-free graphs (Q1613398) (← links)
- Domination in graphoidally covered graphs: least-kernel graphoidal graphs. II (Q1643914) (← links)
- Adding isolated vertices makes some greedy online algorithms optimal (Q1647831) (← links)
- On the semitotal domination number of line graphs (Q1720344) (← links)
- Domination-complete graphs (Q1813388) (← links)
- Irredundance perfect graphs (Q1896349) (← links)
- The \(v\)-number of edge ideals (Q2005190) (← links)
- Introducing \textsf{lop}-kernels: a framework for kernelization lower bounds (Q2093577) (← links)
- Index of parameters of iterated line graphs (Q2142662) (← links)
- Minimum maximal matchings in cubic graphs (Q2144321) (← links)
- Domination chain: characterisation, classical complexity, parameterised complexity and approximability (Q2181241) (← links)
- Independent domination, colorings and the fractional idomatic number of a graph (Q2185446) (← links)
- Domination versus edge domination (Q2197443) (← links)
- On the vertices belonging to all, some, none minimum dominating set (Q2208334) (← links)
- Critical concepts in domination (Q2277481) (← links)
- On graph fall-coloring: existence and constructions (Q2287754) (← links)
- Vizing's conjecture: A two-thirds bound for claw-free graphs (Q2399303) (← links)
- Construction of trees and graphs with equal domination parameters (Q2433721) (← links)
- \([1,2]\)-sets in graphs (Q2446878) (← links)
- Unique irredundance, domination and independent domination in graphs (Q2581412) (← links)
