Abstract
A set D of vertices in a graph G is a locating-dominating set if for every two vertices u, v of \(V-D\) the sets \(N_{G}(u)\cap D\) and \(N_{G}(v)\cap D\) are non-empty and different. The locating-domination number \(\gamma _{L}(G)\) is the minimum cardinality of a locating-dominating set of G. A graph G is \(\gamma _{L}\)-dot-critical if contracting any edge of G decreases its locating-domination number. Let \(k\ge 3\) be an integer. A graph G is called k-\(\gamma _{L}\)-dot-critical if G is \(\gamma _{L}\)-dot-critical with \(\gamma _{L}\left( G\right) =k.\) In this paper, we characterize all connected 3-\(\gamma _{L}\)-dot-critical graphs.
Similar content being viewed by others
References
Blidia, M., Chellali, M.: Locating domination dot-critical graphs. J. Comb. Math. Comb. Comput. 104, 121–141 (2018)
Blidia, M., Chellali, M., Maffray, F., Moncel, J., Semri, A.: Locating-domination and identifying codes in trees. Australas. J. Combin. 39, 219–232 (2007)
Blidia, M., Dali, W.: A characterization of locating-domination edge critical graphs. Australas. J. Combin. 44, 297–300 (2009)
Blidia, M., Dali, W.: A characterization of locating-total domination edge critical graphs. Discuss. Math. Graph Theory 31, 197–202 (2011)
Blidia, M., Dali, W.: On locating and locating-total domination edge addition critical graphs. Util. Math. 94, 303–313 (2014)
Blidia, M., Favaron, O., Lounes, R.: Locating-domination, 2-domination and independence in trees. Australas. J. Combin. 42, 309–316 (2008)
Burton, T., Sumner, D.P.: Domination dot-critical graphs. Discret. Math. 306, 11–18 (2006)
Caceres, J., Hernando, C., Mora, M., Pelayo, I.M., Puertas, M.L.: Locating dominating codes: bounds and extremal cardinalities. Appl. Math. Comput. 220, 38–45 (2013)
Chellali, M.: On locating and differentiating-total domination in trees. Discuss. Math. Graph Theory 28, 383–392 (2008)
Chellali, M., Mimouni, M., Slater, P.J.: On locating-domination in graphs. Discuss. Math. Graph Theory 30, 223–235 (2010)
Chellali, M., Rad, N.J.: Locating-total domination critical graphs. Australas. J. Comb. 45, 227–234 (2009)
Finbow, A., Hartnell, B.L.: On locating dominating sets and well-covered graphs. Congr. Numer. 65, 191–200 (1988)
Foucaud, F., Henning, M.A.: Location-domination and matching in cubic graphs. Discret. Math. 339, 1221–2231 (2016)
Foucaud, F., Henning, M.A., Lowenstein, C., Sasse, T.: Locating-dominating sets in twin-free graphs. Discret. Appl. Math. 200, 52–58 (2016)
Foucaud, F., Henning, M.A.: Location-domination in line graphs. Discret. Math. 340, 3140–3153 (2017)
Garijo, D., Gonzàlez, A., Màrquez, A.: The difference between the metric dimension and the determining number of a graph. Appl. Math. Comput. 249, 487–501 (2014)
Henning, M.A., Lowenstein, C.: Locating-total domination in claw-free cubic graphs. Discret. Math. 312, 3107–3116 (2012)
Rall, D.F., Slater, P.J.: On location-domination numbers for certain classes of graphs. Congr. Numer. 45, 97–106 (1984)
Slater, P.J.: Domination and location in acyclic graphs. Networks 17, 55–64 (1987)
Slater, P.J.: Dominating and reference sets in graphs. J. Math. Phys. Sci. 22, 445–455 (1988)
Author information
Authors and Affiliations
Corresponding author
Additional information
Communicated by Ebrahim Ghorbani.
Publisher's Note
Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.
Rights and permissions
About this article
Cite this article
Mimouni, M., Ikhlef-Eschouf, N. & Zamime, M. On Connected 3-\(\gamma _{L}\)-Dot-Critical Graphs. Bull. Iran. Math. Soc. 48, 979–991 (2022). https://doi.org/10.1007/s41980-021-00558-y
Received:
Revised:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s41980-021-00558-y