Strong defensive alliances on graph operators

Open Access

Issue		RAIRO-Oper. Res. Volume 60, Number 2, March-April 2026


Page(s)		685 - 696
DOI		https://doi.org/10.1051/ro/2026023
Published online		27 March 2026

A. Alsinai, A. Alwardi, H. Ahmed and N.D. Soner, Leap Zagreb indices for the central graph of graph. J. Prime Res. Math. 17 (2021) 73–78. [Google Scholar]
A. Aytaç, T. Turaci and Z.N. Odabaş, On the bondage number of middle graphs. Math. Notes 93 (2013) 795–801. [Google Scholar]
L.A. Basilio, J. Castro, J. Leaños and O. Rosario, The differential on graph operator Q(G). Symmetry 12 (2020) 751. [CrossRef] [Google Scholar]
L.A. Basilio, J.L. Macías, O.R. Cayetano and J.M.S. Almira, The differential on graph operator R(G). RAIRO-Oper. Res. 58 (2024) 5467–5479. [Google Scholar]
S. Bermudo, Total domination on tree operators. Mediterr. J. Math. 20 (2023) 42. [CrossRef] [Google Scholar]
A.R. Bindusree, I.N. Cangul, V. Lokesha and A.S. Cevik, Zagreb polynomials of three graph operators. Filomat 30 (2016) 1979–1986. [CrossRef] [MathSciNet] [Google Scholar]
A. Cami, H. Balakrishnan, N. Deo and R.D. Dutton, On the complexity of finding optimal global alliances. J. Comb. Math. Comb. Comput. 58 (2006) 23–31. [Google Scholar]
W. Carballosa, J.M. Rodríguez, J.M. Sigarreta and N. Vakhania, f-polynomial on some graph operations. Mathematics 7 (2019) 1074. [CrossRef] [Google Scholar]
W. Carballosa, Exact defensive alliances in graphs. Appl. Math. Sci. 7 (2013) 3673–3679. [Google Scholar]
J. Castro, G. Reyna, L.A. Hernández and O. Cayetano, Parámetros de dominación en el operador de grafos S(G). Gac. R. Soc. Mat. Esp. 27 (2024) 347–355. [Google Scholar]
J. Castro, L.A. Basilio, G. Reyna and O. Rosario, The differential on operator $S(\Gamma)$. Math. Biosci. Eng. 20 (2023) 11568–11584. [Google Scholar]
D.M. Cvetković, M. Doob and H. Sachs, Spectra of Graphs: Theory and Application. Academic Press, New York (1980). [Google Scholar]
G.R.J. Eugenio, M.J.P. Ruiz and M.A.C. Tolentino, The set chromatic numbers of the middle graph of graphs. J. Phys.: Conf. Ser. 1836 (2021) 012014. [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]
P.S.W. Harisha and V.L. Ranjini, SK indices of graph operator S (G) and R (G) on few nanostructures. Montes Taurus J. Pure Appl. Math. 2 (2020) 38–44. [Google Scholar]
T.W. Haynes, S.T. Hedetniemi and M.A. Henning, Global defensive alliances in graphs. Electron. J. Comb. 10 (2003) 139–146. [Google Scholar]
J.C. Hernández-Gómez, J.A. Méndez-Bermúdez, J.M. Rodríguez and J.M. Sigarreta, Harmonic index and harmonic polynomial on graph operations. Symmetry 10 (2018) 456. [Google Scholar]
L.H. Jamieson, Algorithms and complexity for alliances and weighted alliances of varoius types. Ph.D. thesis, Clemson University, Clemson, SC, USA (2007). [Google Scholar]
L.H. Jamieson, S.T. Hedetniemi and A.A. McRae, The algorithmic complexity of alliances in graphs. J. Comb. Math. Comb. Comput. 68 (2009) 137–150. [Google Scholar]
F. Kazemnejad and S. Moradi, Total domination number of central graphs. Bull. Korean Math. Soc. 56 (2019) 1059–1075. [Google Scholar]
P. Kristiansen, S.M. Hedetniemi and S.T. Hedetniemi, Alliances in graphs. J. Comb. Math. Comb. Comput. 48 (2004) 157–177. [Google Scholar]
R. Nagarathinam and N. Parvathi, Study of chromatic parameters of line, total, middle graphs and graph operators of bipartite graph. J. Phys.: Conf. Ser. 1000 (2018) 012036. [Google Scholar]
J.A. Rodríguez, I. Gonzalez and J.M. Sigarreta, Defensive k-alliance graphs. Appl. Math. Lett. 22 (2009) 96–100. [Google Scholar]
K.H. Shafique and R.D. Dutton, Maximum alliance-free and minimum alliance-cover sets, in International Symposium on Computer and Information Sciences. CRC Press (2003) 293–297. [Google Scholar]
J.M. Sigarreta, Upper k-alliances in graphs. Int. J. Contemp. Math. Sci. 6 (2011) 2121–2128. [Google Scholar]
J.M. Sigarreta, S. Bermudo and H. Fernau. On the complement graph and defensive k-alliances. Discrete Appl. Math. 157 (2009) 1687–1695. [Google Scholar]
J.M. Sigarreta and J.A. Rodríguez, On defensive alliance and line graphs. Appl. Math. Lett. 19 (2006) 1345–1350. [CrossRef] [MathSciNet] [Google Scholar]
J.M. Sigarreta and J.A. Rodríguez, Global defensive k-aliances in graphs. Discrete Appl. Math. 157 (2009) 211–218. [Google Scholar]
M. Skowrońska and M.M. Sysło, An algorithm to recognize a middle graph. Discrete Appl. Math. 7 (1984) 201–208. [Google Scholar]
S. Sudha and K. Manikandan, Total coloring of central graphs of a path, a cycle and a star. Int. J. Sci. Innov. Math. Res. 5 (2017) 15–22. [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.