Hossein Karami

From MaRDI portal
Person:630190

Available identifiers

zbMath Open karami.hosseinMaRDI QIDQ630190

List of research outcomes





PublicationDate of PublicationType
Disprove of a conjecture on the double Roman domination number2024-03-01Paper
A proof of a conjecture on the connected domination number2022-10-31Paper
Cubic graphs have paired-domination number at most four-seventh of their orders2022-09-26Paper
Disprove of a conjecture on the doubly connected domination subdivision number2022-09-02Paper
https://portal.mardi4nfdi.de/entity/Q58634772022-06-01Paper
A proof of a conjecture on the paired-domination subdivision number2022-03-21Paper
Double Roman domination in graphs with minimum degree at least two and no \(C_5\)-cycle2022-03-15Paper
On a conjecture concerning total domination subdivision number in graphs2022-03-02Paper
Game $k$-Domination Number of Graphs2022-02-11Paper
Roman domination in graphs with minimum degree at least two and some forbidden cycles2021-10-14Paper
Nordhaus–Gaddum type results for connected and total domination2021-07-27Paper
A proof of a conjecture on the differential of a subcubic graph2020-10-14Paper
An improved upper bound on the double Roman domination number of graphs with minimum degree at least two2019-11-06Paper
On two conjectures concerning total domination subdivision number in graphs2019-06-25Paper
Game total domination subdivision number of a graph2015-11-10Paper
Game domination subdivision number of a graph2015-07-01Paper
https://portal.mardi4nfdi.de/entity/Q29335232014-12-03Paper
On the total outer-connected domination in graphs2014-06-24Paper
On the total domination subdivision number in graphs2014-04-25Paper
https://portal.mardi4nfdi.de/entity/Q54040122014-03-19Paper
https://portal.mardi4nfdi.de/entity/Q57465472014-02-07Paper
On the outer-connected domination in graphs2013-08-09Paper
Global signed domination in graphs2013-06-26Paper
https://portal.mardi4nfdi.de/entity/Q49249102013-06-10Paper
The total domination subdivision number in graphs with no induced 3-cycle and 5-cycle2013-04-08Paper
https://portal.mardi4nfdi.de/entity/Q46499912012-11-15Paper
Connected domination number of a graph and its complement2012-01-24Paper
https://portal.mardi4nfdi.de/entity/Q31055372012-01-05Paper
https://portal.mardi4nfdi.de/entity/Q30118332011-06-29Paper
Matchings and total domination subdivision number in graphs with few induced 4-cycles2011-05-09Paper
Bounding the total domination subdivision number of a graph in terms of its order2011-03-17Paper
Inequalities of Nordhaus-Gaddum type for doubly connected domination number2010-11-25Paper
Proof of a conjecture on game domination2010-11-24Paper
On the total domination subdivision number in some classes of graphs2010-11-12Paper
An upper bound for the total domination subdivision number of a graph2010-05-05Paper
Paired-domination subdivision numbers of graphs2010-01-18Paper
A new bound on the total domination subdivision number2009-12-09Paper
On the Roman domination number of a graph2009-06-23Paper
Lower bounds on the signed domination numbers of directed graphs2009-06-19Paper
https://portal.mardi4nfdi.de/entity/Q36261802009-05-22Paper
Lower bounds on signed edge total domination numbers in graphs2009-05-06Paper
Disproof of a conjecture on the subdivision domination number of a graph2009-04-29Paper
Connected domination subdivision numbers of graphs2009-04-14Paper
Paired-domination number of a graph and its complement2009-01-28Paper
Signed edge majority domination numbers in graphs2008-08-12Paper
https://portal.mardi4nfdi.de/entity/Q35142922008-07-21Paper
Total domination and total domination subdivision number of a graph and its complement2008-07-11Paper
Total domination in \(K_5\)- and \(K_6\)-covered graphs2008-05-27Paper
Some notes on signed edge domination in graphs2008-04-16Paper
Trees whose domination subdivision number is one2008-03-11Paper
https://portal.mardi4nfdi.de/entity/Q54423842008-02-22Paper
Trees whose double domination number is twice their domination number2008-02-20Paper

Research outcomes over time

This page was built for person: Hossein Karami