On lower bounds for cardinalities of several separating-dominating codes in graphs
Fuente:
arXiv
Saved in:
| Main Authors: | Chakraborty, Dipayan, Wagler, Annegret K. |
|---|---|
| Format: | Preprint |
| Published: |
2024
|
| Subjects: | |
| Online Access: | |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Similar Items
On open-separating dominating codes in graphs
by: Chakraborty, Dipayan, et al.
Published: (2024)
by: Chakraborty, Dipayan, et al.
Published: (2024)
On full-separating sets and related codes in graphs
by: Chakraborty, Dipayan, et al.
Published: (2024)
by: Chakraborty, Dipayan, et al.
Published: (2024)
On three domination-based identification problems in block graphs
by: Chakraborty, Dipayan, et al.
Published: (2018)
by: Chakraborty, Dipayan, et al.
Published: (2018)
The Interplay Between Domination and Separation in Graphs
by: Chakraborty, Dipayan, et al.
Published: (2026)
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)
by: Chakraborty, Dipayan, et al.
Published: (2022)
The $n/2$-bound for locating-dominating sets in subcubic graphs
by: Chakraborty, Dipayan, et al.
Published: (2024)
by: Chakraborty, Dipayan, et al.
Published: (2024)
Identifying codes in triangle-free graphs of bounded maximum degree
by: Chakraborty, Dipayan, et al.
Published: (2024)
by: Chakraborty, Dipayan, et al.
Published: (2024)
Identifying open codes in trees and 4-cycle-free graphs of given maximum degree
by: Chakraborty, Dipayan, et al.
Published: (2024)
by: Chakraborty, Dipayan, et al.
Published: (2024)
Identifying codes in graphs of given maximum degree: Characterizing trees
by: Chakraborty, Dipayan, et al.
Published: (2024)
by: Chakraborty, Dipayan, et al.
Published: (2024)
On locating and neighbor-locating colorings of sparse graphs
by: Chakraborty, Dipayan, et al.
Published: (2023)
by: Chakraborty, Dipayan, et al.
Published: (2023)
A general lower bound for the domination number of cylindrical graphs
by: Carreño, José Juan, et al.
Published: (2018)
by: Carreño, José Juan, et al.
Published: (2018)
New improved lower bounds for Zagreb indices of graphs
by: Verma, Mamta, et al.
Published: (2025)
by: Verma, Mamta, et al.
Published: (2025)
Upper bounds for linear graph codes
by: Versteegen, Leo
Published: (2023)
by: Versteegen, Leo
Published: (2023)
Semidefinite lower bounds for covering codes
by: Gijswijt, Dion, et al.
Published: (2025)
by: Gijswijt, Dion, et al.
Published: (2025)
A linear algorithm for radio $k$-coloring of powers of paths having small diameters
by: Chakraborty, Dipayan, et al.
Published: (2021)
by: Chakraborty, Dipayan, et al.
Published: (2021)
Lower bounds for the total (distance) $k$-domination number of a graph
by: Davila, Randy
Published: (2024)
by: Davila, Randy
Published: (2024)
Tight upper bounds on the hop domination number of triangle-free graphs
by: Fujita, Shinya, et al.
Published: (2025)
by: Fujita, Shinya, et al.
Published: (2025)
Some sharp lower bounds for the bipartite Turán number of theta graphs
by: Theodorakopoulos, Stefanos
Published: (2024)
by: Theodorakopoulos, Stefanos
Published: (2024)
Sharp lower bounds and extremal graphs for the generalized $k$-independence number
by: Huang, Jing, et al.
Published: (2025)
by: Huang, Jing, et al.
Published: (2025)
New lower bounds on the non-repetitive chromatic number of some graphs
by: Tao, Tianyi, et al.
Published: (2025)
by: Tao, Tianyi, et al.
Published: (2025)
Algorithm for finding vertex-edge domination number on graphs with bounded treewidth and related problems on planar graphs
by: Wang, Yichen, et al.
Published: (2026)
by: Wang, Yichen, et al.
Published: (2026)
Upper bounds for double Roman domination and $[k]$-Roman domination of cylindrical graphs $C_m \Box P_n$
by: Brezovnik, Simon, et al.
Published: (2026)
by: Brezovnik, Simon, et al.
Published: (2026)
A lower bound of toughness of regular graphs: in terms of second largest eigenvalue
by: Zhang, Wenqian
Published: (2026)
by: Zhang, Wenqian
Published: (2026)
Improved lower bounds on the maximum size of graphs with girth 5
by: Goedgebeur, Jan, et al.
Published: (2025)
by: Goedgebeur, Jan, et al.
Published: (2025)
An improved upper bound for the domination number of a graph
by: Arumugam, Subramanian, et al.
Published: (2024)
by: Arumugam, Subramanian, et al.
Published: (2024)
Ramsey lower bounds for bounded degree hypergraphs
by: Fan, Chunchao, et al.
Published: (2026)
by: Fan, Chunchao, et al.
Published: (2026)
Best possible upper bounds on the restrained domination number of cubic graphs
by: Brešar, Boštjan, et al.
Published: (2024)
by: Brešar, Boštjan, et al.
Published: (2024)
Tight bound for independent domination of cubic graphs without $4$-cycles
by: Cho, Eun-Kyung, et al.
Published: (2021)
by: Cho, Eun-Kyung, et al.
Published: (2021)
Domination inequalities and dominating graphs
by: Conlon, David, et al.
Published: (2023)
by: Conlon, David, et al.
Published: (2023)
Locating-dominating coalitions in graphs
by: Chellali, M., et al.
Published: (2026)
by: Chellali, M., et al.
Published: (2026)
Breaking small automorphisms of graphs of arbitrary cardinality
by: Stawiski, Marcin
Published: (2026)
by: Stawiski, Marcin
Published: (2026)
Several Roman domination graph invariants on Kneser graphs
by: Zec, Tatjana, et al.
Published: (2022)
by: Zec, Tatjana, et al.
Published: (2022)
Characterization of sparse monotone graph classes with bounded domination-to-2-independence ratio
by: Bonamy, Marthe, et al.
Published: (2026)
by: Bonamy, Marthe, et al.
Published: (2026)
An exponential improvement for Ramsey lower bounds
by: Ma, Jie, et al.
Published: (2025)
by: Ma, Jie, et al.
Published: (2025)
An update on multicolor Ramsey lower bounds
by: Campos, Marcelo, et al.
Published: (2026)
by: Campos, Marcelo, et al.
Published: (2026)
An asymptotic lower bound on the number of polyominoes
by: Bui, Vuong
Published: (2022)
by: Bui, Vuong
Published: (2022)
On cubic rainbow domination regular graphs
by: Kuzman, Bostjan
Published: (2024)
by: Kuzman, Bostjan
Published: (2024)
Reconfiguration graphs for minimal domination sets
by: Beaton, Iain
Published: (2024)
by: Beaton, Iain
Published: (2024)
Maximal double Roman domination in graphs
by: Ahangar, H. Abdollahzadeh, et al.
Published: (2024)
by: Ahangar, H. Abdollahzadeh, et al.
Published: (2024)
Antimagicness of graphs with a dominating clique
by: Beaudoire, Grégoire, et al.
Published: (2025)
by: Beaudoire, Grégoire, et al.
Published: (2025)
Similar Items
-
On open-separating dominating codes in graphs
by: Chakraborty, Dipayan, et al.
Published: (2024) -
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)