On the outer-independent total (Roman) domination number of some graph operators

Open Access

Issue		RAIRO-Oper. Res. Volume 60, Number 3, May-June 2026


Page(s)		1487 - 1499
DOI		https://doi.org/10.1051/ro/2026046
Published online		09 June 2026

L.A. Basilio, J. Castro Simon, J. Leanos and O. Rosario, The differential on graph operator Q(G). Symmetry 12 (2020) 751. [CrossRef] [Google Scholar]
L.A. Basilio, J. Leanos, O. Rosario and J.M. Sigarreta, The differential on graph operator R(G). RAIRO-Oper. Res. 58 (2024) 5467–5479. [Google Scholar]
M. Behzad, A criterion for the planarity of the total graph of a graph. Math. Proc. Cambridge Philos. Soc. 63 (1967) 679–681. [Google Scholar]
S. Bermudo, Total domination on tree operators. Mediterr. J. Math. 20 (2023) 42. [CrossRef] [Google Scholar]
A. Cabrera Martínez, F.A. Hernández Mira, J.M. Sigarreta Almira and I.G. Yero, On computational and combinatorial properties of the total co-independent domination number of graphs. Comput. J. 62 (2019) 97–108. [Google Scholar]
A. Cabrera Martínez, D. Kuziak and I.G. Yero, Outer-independent total Roman domination in graphs. Discrete Appl. Math. 269 (2019) 107–119. [Google Scholar]
A. Cabrera Martínez, I. Peterin and I.G. Yero, Independent transversal total domination versus total domination in trees. Discuss. Math. Graph Theory 41 (2021) 213–224. [Google Scholar]
A. Cabrera Martínez, S. Cabrera García, I. Peterin and I.G. Yero, The total co-independent domination number of some graph operations. Rev. Union Mat. Argentina 63 (2022) 153–168. [Google Scholar]
A. Cabrera Martínez, D. Kuziak and I.G. Yero, Relating the outer-independent total Roman domination number with some classical parameters of graphs. Mediterr. J. Math. 19 (2022) 144. [Google Scholar]
A. Cabrera Martínez, F.A. Hernández, J.M. Sigarreta and I.G. Yero, A note on total co-independent domination in trees. Contrib. Discrete Math. 19 (2024) 184–195. [Google Scholar]
A. Cabrera-Martínez, J.L. Sanchez and J.M. Sigarreta, On the total domination number of total graphs. Discuss. Math. Graph Theory 44 (2024) 933–151. [Google Scholar]
E.J. Cockayne, S.T. Hedetniemi and D.J. Miller, Properties of hereditary hypergraphs and middle graphs. Canad. Math. Bull. 21 (1978) 461–468. [Google Scholar]
S. Fujita, F. Kazemnejad and B. Pahlavsay, New classification of graph in view of the domination number of central graphs. Preprint arXiv: 2204.10292 (2022). [Google Scholar]
T. Hamada and I. Yoshimura, Traversability and connectivity of the middle graph of a graph. Discrete Math. 14 (1976) 247–255. [CrossRef] [MathSciNet] [Google Scholar]
T.W. Haynes, S.T. Hedetniemi and P.J. Slater, Fundamentals of Domination in Graphs. Chapman and Hall/CRC Pure and Applied Mathematics Series, Marcel Dekker, Inc. New York, 1998. [Google Scholar]
F. Kazemnejad and S. Moradi, Total domination number of central graphs. Bull. Korean Math. Soc. 56 (2019) 1059–1075. [Google Scholar]
F. Kazemnejad, B. Pahlavsay, E. Palezzato and M. Torielli, Total domination number of middle graphs. Electron. J. Graph Theory App. 10 (2022) 275–288. [Google Scholar]
F. Kazemnejad, B. Pahlavsay, E. Palezzato and M. Torielli, Domination number of middle graphs. Trans. Comb. 12 (2023) 79–91. [MathSciNet] [Google Scholar]
K. Kijung, Domination-related parameters in middle graphs. Discrete Math. Algorithm. Appl. 16 (2024) 2350060. [Google Scholar]
M. Krzywkowski, A lower bound on the total outer-independent domination number of a tree. C. R. Math. 349 (2011) 7–9. [Google Scholar]
M. Krzywkowski, An upper bound on the total outer-independent domination number of a tree. Opus. Math. 32 (2012) 153–158. [Google Scholar]
Z. Li, Z. Shao, F. Lang, X. Zhang and J.-B. Liu, Computational complexity of outer-independent total and total Roman domination numbers in trees. IEEE Access 6 (2018) 35544–35550. [Google Scholar]
D.A. Mojdeh, I. Peterin, B. Samadi and I.G. Yero, On three outer-independent domination related parameters in graphs. Discrete Appl. Math. 294 (2021) 115–124. [Google Scholar]
E. Murugan, and J. Paulraj, On the domination number of a graph and its total graph. Discrete Math. Algorithms Appl. 12 (2020) 2050068. [Google Scholar]
H.P. Patil and R. Pandiya Raj, On the total graph of Mycielski graphs, central graphs and their covering numbers. Discuss. Math. Graph Theory 33 (2013) 361–371. [Google Scholar]
A. Poureidi, M. Ghaznavi and J. Fathali, Algorithmic complexity of outer independent Roman domination and outer independent total Roman domination. J. Comb. Optim. 41 (2021) 304–317. [Google Scholar]
A. Sharma and P. Venkata Subba Reddy, Algorithmic aspects of outer-independent total Roman domination in graphs. Int. J. Found. Comput. Sci. 32 (2021) 331–339. [Google Scholar]
J.M. Sigarreta, Total domination on some graph operators. Mathematics 9 (2021) 241. [CrossRef] [Google Scholar]
N.D. Soner, B.V. Dhananjaya Murthy and G. Deepak, Total co-independent domination in graphs. Appl. Math. Sci. 6 (2012) 129–132. [Google Scholar]
T. Tamizh Chelvam and T. Asir, Domination in the total graph on Zn. Discrete Math. Algorithms Appl. 3 (2011) 413–421. [Google Scholar]
S.K. Vaidya and N.J. Kothari, Some new results on distance k-domination in graphs. Int. J. Comb. 2013 (2013) 795401. [Google Scholar]
V.J. Vernold, Harmonious coloring of total graphs, n-leaf, central graphs and circumdetic graphs. Ph.D. Thesis, Bharathiar University, Coimbatore, India (2007). [Google Scholar]

Current usage metrics show cumulative count of Article Views (full-text article views including HTML views, PDF and ePub downloads, according to the available data) and Abstracts Views on Vision4Press platform.

Data correspond to usage on the plateform after 2015. The current usage metrics is available 48-96 hours after online publication and is updated daily on week days.

Initial download of the metrics may take a while.