The following pages link to Nader Jafari Rad (Q279205):
Displaying 50 items.
- Domination stability in graphs (Q279207) (← links)
- Edge-removal and edge-addition in \(\alpha \)-domination (Q293651) (← links)
- Total restrained reinforcement in graphs (Q322041) (← links)
- On the complexity of reinforcement in graphs (Q339476) (← links)
- Bounds on the 2-rainbow domination number of graphs (Q354420) (← links)
- On 3-\(\gamma_t\)-vertex critical graphs of diameter three (Q412388) (← links)
- On \(\alpha\)-total domination in graphs (Q423927) (← links)
- Locating-total domination in graphs (Q442212) (← links)
- NP-hardness of multiple bondage in graphs (Q491093) (← links)
- Bounds on the independence number of a graph in terms of order, size and maximum degree (Q516816) (← links)
- Some notes on domination edge critical graphs (Q544890) (← links)
- Total domination dot-critical graphs (Q617644) (← links)
- A note on total reinforcement in graphs (Q642968) (← links)
- Roman domination dot-critical trees (Q647236) (← links)
- Outer-\(k\)-connected component domination in graphs (Q656132) (← links)
- On the Roman bondage number of planar graphs (Q659719) (← links)
- (Q726512) (redirect page) (← links)
- Strong equality between the 2-rainbow domination and independent 2-rainbow domination numbers in trees (Q726513) (← links)
- Various bounds for liar's domination number (Q726641) (← links)
- A note on neighborhood total domination in graphs (Q746350) (← links)
- Erratum to ``Total domination supercritical graphs with respect to relative complements'' [Discrete Math. 258 (2002) 361-371] (Q764897) (← links)
- On an open problem concerning total domination critical graphs (Q996998) (← links)
- On total domination vertex critical graphs of high connectivity (Q1026168) (← links)
- On the diameter of a domination dot-critical graph (Q1028143) (← links)
- Some progress on the double Roman domination in graphs (Q1630922) (← links)
- Bounds on global total domination in graphs (Q1650309) (← links)
- Hat problem on graphs with exactly three cycles (Q1650359) (← links)
- Retracted: A remark on the weak Turán's theorem (Q1650389) (← links)
- Bounds for the independence number in \(k\)-step Hamiltonian graphs (Q1650405) (← links)
- Bounds on the locating Roman domination number in trees (Q1692624) (← links)
- On \(\alpha \)-domination in graphs (Q1706432) (← links)
- Bounds on the locating-domination number and differentiating-total domination number in trees (Q1708392) (← links)
- Fair domination number in cactus graphs (Q1717201) (← links)
- A new lower bound on the double domination number of a graph (Q1720339) (← links)
- A characterization of double Roman trees (Q1735679) (← links)
- Graphs with large total 2-rainbow domination number (Q1787767) (← links)
- Correction to: ``Graphs with large total 2-rainbow domination number'' (Q1787782) (← links)
- A note on the global offensive alliances in graphs (Q1801085) (← links)
- Some results on roman domination edge critical graphs (Q1927700) (← links)
- Bounds on the identifying codes in trees (Q2000553) (← links)
- Some progress on total bondage in graphs (Q2014725) (← links)
- Computing strong Roman domination of trees and unicyclic graphs in linear time (Q2082401) (← links)
- A classification of cactus graphs according to their domination number (Q2118249) (← links)
- Improved bounds on the \(k\)-tuple (Roman) domination number of a graph (Q2121485) (← links)
- Algorithmic aspects of the independent 2-rainbow domination number and independent Roman \(\{2\}\)-domination number (Q2151206) (← links)
- The Roman domatic problem in graphs and digraphs: a survey (Q2151218) (← links)
- Bounds on the double Italian domination number of a graph (Q2158195) (← links)
- On generalized topological indices of silicon-carbon (Q2176058) (← links)
- A note on the fair domination number in outerplanar graphs (Q2194533) (← links)
- On algorithmic complexity of double Roman domination (Q2197468) (← links)
