Cover Image

Fault-tolerant mutual-visibility: complexity and solutions for grid-like networks

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Cicerone, Serafino, Di Stefano, Gabriele, Klavžar, Sandi, Zhang, Gang
Format:	Preprint
Published:	2025
Subjects:	Combinatorics Discrete Mathematics 05C12, 05C69, 05C76, 68Q17
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

Mutual-visibility problems on graphs of diameter two
by: Cicerone, Serafino, et al.
Published: (2024)

Mutual-visibility Coloring of Graphs
by: Babu, Saneesh, et al.
Published: (2025)

Lower General Position Sets in Graphs
by: Di Stefano, Gabriele, et al.
Published: (2023)

Injective colorings of Sierpiński-like graphs and Kneser graphs
by: Brešar, Boštjan, et al.
Published: (2024)

The General Position Problem: A Survey
by: V., Ullas Chandran S., et al.
Published: (2025)

Analyzing Network Robustness via Residual Closeness
by: Golpek, Hande Tuncel, et al.
Published: (2026)

M-Polynomial of Product Graphs
by: Mehiri, El-Mehdi, et al.
Published: (2026)

Edge open packing: complexity, algorithmic aspects, and bounds
by: Brešar, Boštjan, et al.
Published: (2024)

Moving through Cartesian products, coronas and joins in general position
by: Klavžar, Sandi, et al.
Published: (2025)

Coloring the vertices of a graph with mutual-visibility property
by: Klavžar, Sandi, et al.
Published: (2024)

Results on three problems on isolation of graphs
by: Borg, Peter, et al.
Published: (2026)

The Upper Clique Transversal Problem
by: Milanič, Martin, et al.
Published: (2023)

Strengthening Wilf's lower bound on clique number
by: Jadav, Hareshkumar, et al.
Published: (2025)

Distance mutual-visibility coloring: relations with (total) domination, exact distance graphs and graph products
by: Babu, Saneesh, et al.
Published: (2025)

Perfecting the Line Graph
by: Bal, Hartosh Singh
Published: (2025)

Homomorphically Full Oriented Graphs
by: Bellitto, Thomas, et al.
Published: (2022)

New Optimal Results on Codes for Location in Graphs
by: Junnila, Ville, et al.
Published: (2023)

Explicit Formulas and Unimodality Phenomena for General Position Polynomials
by: Rather, Bilal Ahmad
Published: (2026)

More algorithmic results for problems of spread of influence in edge-weighted graphs with and without incentives
by: Askari, Siavash, et al.
Published: (2024)

$[k]$-Roman domination on cylindrical grids $C_m \Box P_n$
by: Brezovnik, Simon, et al.
Published: (2026)

Further results on \([k]\)-Roman domination on cylindrical grids \(C_m \Box P_n\)
by: Brezovnik, Simon, et al.
Published: (2026)

Self-identifying codes in direct products of complete graphs with paths and cycles
by: Liu, Jihong, et al.
Published: (2025)

Closeness and Residual Closeness of Harary Graphs
by: Golpek, Hande Tuncel, et al.
Published: (2023)

Symmetry classes of Hamiltonian cycles
by: Baligacs, Julia, et al.
Published: (2025)

Structure and algorithms for graphs excluding grids with small parity breaks as odd-minors
by: Gollin, J. Pascal, et al.
Published: (2023)

The odd independence number of graphs, II: Finite and infinite grids and chessboard graphs
by: Caro, Yair, et al.
Published: (2025)

Fault-tolerant Locating-Dominating Sets on the Infinite King Grid
by: Jean, Devin, et al.
Published: (2022)

Treewidth versus clique number. IV. Tree-independence number of graphs excluding an induced star
by: Dallard, Clément, et al.
Published: (2024)

The hard-core model in graph theory
by: Davies, Ewan, et al.
Published: (2025)

On k-(total) limited packing in graphs
by: Ahmadi, Azam Sadat, et al.
Published: (2024)

Builder-Blocker General Position Games
by: Klavžar, Sandi, et al.
Published: (2023)

Closing Trees into Unicyclic Counterexamples
by: Levit, Vadim E., et al.
Published: (2026)

Tree decompositions meet induced matchings: beyond Max Weight Independent Set
by: Lima, Paloma T., et al.
Published: (2024)

On $\{k\}$-Roman graphs: complexity of recognition and the case of split graphs
by: Štorgel, Kenny Bešter, et al.
Published: (2025)

A dichotomy theorem on the complexity of 3-uniform hypergraphic degree sequence graphicality
by: Logsdon, Sara, et al.
Published: (2024)

Induced matching vs edge open packing: trees and product graphs
by: Bresar, Bostjan, et al.
Published: (2024)

On the domination number of the cartesian product of the path graph and any pair of graphs
by: Tout, Omar
Published: (2023)

Exact double domination in subdivision, Mycielskian and middle graphs
by: Behtoei, Ali, et al.
Published: (2024)

An asymptotically tight upper bound for the domination number of the $2$-token graph of path graphs
by: Troncoso, E. Acosta, et al.
Published: (2026)

Grundy double domination number: bounds, graph operations, and efficient computation for $P_4$-tidy graphs
by: Torres, Pablo
Published: (2025)