Cover Image

On open-separating dominating codes in graphs

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Chakraborty, Dipayan, Wagler, Annegret K.
Format:	Preprint
Published:	2024
Subjects:	Combinatorics Discrete Mathematics
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

On full-separating sets and related codes in graphs
by: Chakraborty, Dipayan, et al.
Published: (2024)

On three domination-based identification problems in block graphs
by: Chakraborty, Dipayan, et al.
Published: (2018)

The Interplay Between Domination and Separation in Graphs
by: Chakraborty, Dipayan, et al.
Published: (2026)

Progress towards the two-thirds conjecture on locating-total dominating sets
by: Chakraborty, Dipayan, et al.
Published: (2022)

On lower bounds for cardinalities of several separating-dominating codes in graphs
by: Chakraborty, Dipayan, et al.
Published: (2024)

On locating and neighbor-locating colorings of sparse graphs
by: Chakraborty, Dipayan, et al.
Published: (2023)

Extremal digraphs for open neighbourhood location-domination and identifying codes
by: Foucaud, Florent, et al.
Published: (2023)

Secure domination in $P_5$-free graphs
by: Gupta, Uttam K., et al.
Published: (2025)

List homomorphisms to separable signed graphs
by: Bok, Jan, et al.
Published: (2023)

The 1/3-conjectures for domination in cubic graphs
by: Dorbec, Paul, et al.
Published: (2024)

On graph classes with constant domination-packing ratio
by: Bonamy, Marthe, et al.
Published: (2025)

Vertex-edge domination on subclasses of bipartite graphs
by: Pandey, Arti, et al.
Published: (2025)

Optimal local identifying and local locating-dominating codes
by: Herva, Pyry, et al.
Published: (2023)

$K_{2,3}$-induced minor-free graphs admit quasi-isometry with additive distortion to graphs of tree-width at most two
by: Chakraborty, Dibyayan
Published: (2025)

Strong isometric path complexity of graphs: Asymptotic minors, restricted holes, and graph operations
by: Chakraborty, Dibyayan, et al.
Published: (2025)

Edge open packing on subclasses of chordal graphs
by: Santra, Kamal
Published: (2025)

Relation between broadcast domination and multipacking numbers on chordal and other hyperbolic graphs
by: Das, Sandip, et al.
Published: (2023)

Powers of large matrices on GPU platforms to compute the Roman domination number of cylindrical graphs
by: Martínez, J. A., et al.
Published: (2024)

HPC acceleration of large (min, +) matrix products to compute domination-type parameters in graphs
by: Garzón, E. M., et al.
Published: (2024)

Distance-based (and path-based) covering problems for graphs of given cyclomatic number
by: Chakraborty, Dibyayan, et al.
Published: (2025)

A polynomial bound on the number of minimal separators and potential maximal cliques in $P_6$-free graphs of bounded clique number
by: Pilipczuk, Marcin, et al.
Published: (2023)

Halfspace separation in geodesic convexity
by: Nair, Niranjan
Published: (2026)

Roman domination in weighted graphs
by: Cera, Martín, et al.
Published: (2025)

Disjunctive domination in maximal outerplanar graphs
by: Henning, Michael A., et al.
Published: (2025)

On coarse tree decompositions and coarse balanced separators
by: Abrishami, Tara, et al.
Published: (2025)

Locating-dominating partitions for some classes of graphs
by: Foucaud, Florent, et al.
Published: (2025)

Edge open packing: further characterizations
by: Pandey, Arti, et al.
Published: (2025)

Hamiltonicity of Schrijver graphs and stable Kneser graphs
by: Mütze, Torsten, et al.
Published: (2024)

On universal graphs for trees and treewidth $k$ graphs
by: Kaul, Neel, et al.
Published: (2025)

Vertex-critical graphs in co-gem-free graphs
by: Beaton, Iain, et al.
Published: (2024)

Effects of graph operations on star pairwise compatibility graphs
by: Monti, Angelo, et al.
Published: (2024)

Determining a graph from its reconfiguration graph
by: Berthe, Gaétan, et al.
Published: (2025)

An improved upper bound for the domination number of a graph
by: Arumugam, Subramanian, et al.
Published: (2024)

Long induced paths in sparse graphs and graphs with forbidden patterns
by: Duron, Julien, et al.
Published: (2024)

Bounds and extremal graphs for monitoring edge-geodetic sets in graphs
by: Foucaud, Florent, et al.
Published: (2024)

Hitting all longest paths in $H$-free graphs and $H$-graphs
by: de Lima, Paloma T., et al.
Published: (2025)

Diameter of the inversion graph
by: Havet, Frédéric, et al.
Published: (2024)

Colouring t-perfect graphs
by: Chudnovsky, Maria, et al.
Published: (2024)

Contractions in perfect graph
by: Dupont-Bouillard, Alexandre, et al.
Published: (2024)

EPPA numbers of graphs
by: Bradley-Williams, David, et al.
Published: (2023)