Pages that link to "Item:Q998491"
From MaRDI portal
The following pages link to A survey of selected recent results on total domination in graphs (Q998491):
Displaying 50 items.
- \( K_{1 , 2}\)-isolation in graphs (Q2231782) (← links)
- Quasi-total Roman domination in graphs (Q2275312) (← links)
- On a conjecture of Murty and Simon on diameter 2-critical graphs (Q2275449) (← links)
- Integer linear programming models for the weighted total domination problem (Q2279352) (← links)
- Total Roman reinforcement in graphs (Q2312053) (← links)
- Outer-independent total Roman domination in graphs (Q2328098) (← links)
- Packing and domination parameters in digraphs (Q2328107) (← links)
- Semipaired domination in maximal outerplanar graphs (Q2331595) (← links)
- The total bondage numbers and efficient total dominations of vertex-transitive graphs (Q2333221) (← links)
- Disjoint paired-dominating sets in cubic graphs (Q2334075) (← links)
- Trees with large neighborhood total domination number (Q2348059) (← links)
- A linear-time algorithm for paired-domination on circular-arc graphs (Q2354407) (← links)
- Total dominator colorings and total domination in graphs (Q2354609) (← links)
- Total restrained bondage in graphs (Q2376640) (← links)
- Total Roman domination in the lexicographic product of graphs (Q2420413) (← links)
- Nordhaus-Gaddum bounds for total domination (Q2430063) (← links)
- On matching and semitotal domination in graphs (Q2440939) (← links)
- Total and paired domination numbers of toroidal meshes (Q2444139) (← links)
- Bounds on neighborhood total domination in graphs (Q2444537) (← links)
- Efficient self-stabilizing algorithms for minimal total \(k\)-dominating sets in graphs (Q2446589) (← links)
- Equality in a linear Vizing-like relation that relates the size and total domination number of a graph (Q2446844) (← links)
- Bounds on the connected domination number of a graph (Q2446883) (← links)
- The algorithmic complexity of bondage and reinforcement problems in bipartite graphs (Q2447764) (← links)
- A characterization of \(P_5\)-free, diameter-2-critical graphs (Q2449064) (← links)
- 2-colorings in \(k\)-regular \(k\)-uniform hypergraphs (Q2509706) (← links)
- Domination parameters in coronene torus network (Q2516501) (← links)
- Partitioning claw-free subcubic graphs into two dominating sets (Q2657047) (← links)
- On the total and strong version for Roman dominating functions in graphs (Q2662879) (← links)
- The restrained double Roman domination in graphs (Q2683144) (← links)
- Relating the annihilation number and the total domination number for some graphs (Q2696610) (← links)
- Relating the total \(\{2\}\)-domination number with the total domination number of graphs (Q2700617) (← links)
- b-Disjunctive Total Domination in Graphs: Algorithm and Hardness Results (Q2795954) (← links)
- Total domination in graphs with diameter 2 (Q2874092) (← links)
- Algorithmic Aspects of Disjunctive Total Domination in Graphs (Q2958321) (← links)
- Disjunctive total domination in permutation graphs (Q2966509) (← links)
- COMPLEXITY OF CERTAIN FUNCTIONAL VARIANTS OF TOTAL DOMINATION IN CHORDAL BIPARTITE GRAPHS (Q3166754) (← links)
- Domination and Total Domination in Hypergraphs (Q3384117) (← links)
- Domination in Digraphs (Q3384119) (← links)
- Connected Domination (Q3384607) (← links)
- Closed formulas for the total Roman domination number of lexicographic product graphs (Q3390051) (← links)
- Game total domination subdivision number of a graph (Q3451061) (← links)
- The Disjunctive Bondage Number and the Disjunctive Total Bondage Number of Graphs (Q3467878) (← links)
- (Q3815322) (← links)
- A note on improved upper bounds on the transversal number of hypergraphs (Q4621301) (← links)
- Total $k$-Rainbow domination numbers in graphs (Q4635026) (← links)
- Total Roman {2}-domination in graphs (Q4986532) (← links)
- Double outer-independent domination number of graphs (Q5023632) (← links)
- Bounds on the domination number of a digraph and its reverse (Q5024936) (← links)
- Chromatic total domination in graphs (Q5036674) (← links)
- Integer linear programming formulations for double roman domination problem (Q5038168) (← links)
