The following pages link to Hossein Karami (Q630190):
Displaying 50 items.
- (Q358643) (redirect page) (← links)
- On the outer-connected domination in graphs (Q358644) (← links)
- On the total domination subdivision number in some classes of graphs (Q604875) (← links)
- Inequalities of Nordhaus-Gaddum type for doubly connected domination number (Q608251) (← links)
- Bounding the total domination subdivision number of a graph in terms of its order (Q630192) (← links)
- Connected domination number of a graph and its complement (Q659759) (← links)
- Paired-domination subdivision numbers of graphs (Q844217) (← links)
- Total domination and total domination subdivision number of a graph and its complement (Q932661) (← links)
- An upper bound for the total domination subdivision number of a graph (Q968208) (← links)
- Paired-domination number of a graph and its complement (Q998404) (← links)
- Disproof of a conjecture on the subdivision domination number of a graph (Q1014812) (← links)
- Lower bounds on the signed domination numbers of directed graphs (Q1025527) (← links)
- On the Roman domination number of a graph (Q1025980) (← links)
- A new bound on the total domination subdivision number (Q1043795) (← links)
- The total domination subdivision number in graphs with no induced 3-cycle and 5-cycle (Q1945693) (← links)
- A proof of a conjecture on the differential of a subcubic graph (Q2004071) (← links)
- On the total outer-connected domination in graphs (Q2015786) (← links)
- A proof of a conjecture on the connected domination number (Q2091175) (← links)
- Double Roman domination in graphs with minimum degree at least two and no \(C_5\)-cycle (Q2115152) (← links)
- A proof of a conjecture on the paired-domination subdivision number (Q2117538) (← links)
- Disprove of a conjecture on the doubly connected domination subdivision number (Q2169241) (← links)
- An improved upper bound on the double Roman domination number of graphs with minimum degree at least two (Q2334052) (← links)
- Game domination subdivision number of a graph (Q2352356) (← links)
- Global signed domination in graphs (Q2376930) (← links)
- On two conjectures concerning total domination subdivision number in graphs (Q2424813) (← links)
- On the total domination subdivision number in graphs (Q2447321) (← links)
- Some notes on signed edge domination in graphs (Q2482345) (← links)
- Cubic graphs have paired-domination number at most four-seventh of their orders (Q2675847) (← links)
- (Q2933523) (← links)
- Matchings and total domination subdivision number in graphs with few induced 4-cycles (Q2997587) (← links)
- (Q3011833) (← links)
- Proof of a conjecture on game domination (Q3057060) (← links)
- (Q3105537) (← links)
- Game total domination subdivision number of a graph (Q3451061) (← links)
- (Q3514292) (← links)
- (Q3517180) (← links)
- (Q3620552) (← links)
- Lower bounds on signed edge total domination numbers in graphs (Q3624905) (← links)
- (Q3626180) (← links)
- (Q4649991) (← links)
- (Q4924910) (← links)
- Nordhaus–Gaddum type results for connected and total domination (Q5002261) (← links)
- Game $k$-Domination Number of Graphs (Q5029314) (← links)
- (Q5387728) (← links)
- (Q5404012) (← links)
- (Q5442384) (← links)
- (Q5443162) (← links)
- (Q5449154) (← links)
- (Q5746547) (← links)
- On a conjecture concerning total domination subdivision number in graphs (Q5861703) (← links)
