:: Library Catalog

Cover Image

Saved in:

Bibliographic Details
Main Authors:	Gao, Hong, Qiu, Daoda, Du, Shuyan, Zhao, Yiyue, Yang, Yuansheng
Format:	Preprint
Published:	2024
Subjects:	Combinatorics
Online Access:	https://arxiv.org/abs/2410.06486
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

The Domination and Secure Domination Numbers of Direct Product of Cliques with Paths and Cycles
by: Bakal, Deepak M., et al.
Published: (2025)

Independent [k]-Roman Domination on Graphs
by: Luiz, Atílio Gomes, et al.
Published: (2024)

On the $nk-attack Roman Dominating Number of a Graph
by: Koch, Garrison, et al.
Published: (2023)

Exploring Algorithmic Solutions for the Independent Roman Domination Problem in Graphs
by: Paul, Kaustav, et al.
Published: (2024)

(Independent) Roman Domination Parameterized by Distance to Cluster
by: Ashok, Pradeesha, et al.
Published: (2024)

A Systematic Approach to Crossing Numbers of Cartesian Products with Paths
by: Asiri, Zayed, et al.
Published: (2024)

Backward Arcs in Hamilton Oriented Cycles and Paths in Directed Graphs with Independence Number Two
by: Gerke, S., et al.
Published: (2026)

The Signed Roman Domination Number of Ladder graphs, circular Ladder graphs and their complements
by: Haje, Dilbak, et al.
Published: (2024)

Triple Roman Domination in Graphs
by: Ahangar, Hossein Abdollahzadeh, et al.
Published: (2024)

Roman Domination on Graphings
by: Rettich, Adrian
Published: (2024)

p-Strong Roman Domination in Graphs
by: Valenzuela-Tripodoro, J. C., et al.
Published: (2025)

Total Roman {2}-Dominating functions in Graphs
by: Ahangar, H. Abdollahzadeh, et al.
Published: (2024)

Further Results on the Majority Roman Domination in graphs
by: Emadi, Azam Sadat, et al.
Published: (2024)

Improved Total Domination and Total Roman Domination in Unit Disk Graphs
by: Rout, Sasmita, et al.
Published: (2024)

On the DP-chromatic Number of Cartesian Products of Critical Graphs
by: Kaul, Hemanshu, et al.
Published: (2025)

Independent Domination of k-Trees
by: Pham, Andrew
Published: (2024)

An EKR Theorem for the Cartesian Product of Complete Graphs
by: Joseph, Zaphenath
Published: (2025)

Algebraic and Combinatorial Stability of Independence Polynomials in Iterated Strong Products of Cycles
by: Hildebrant, Todd
Published: (2025)

A note on the Ratio and Inertia Bounds for the $k$-Independence Number
by: Gao, Jun, et al.
Published: (2026)

Complexity Issues Concerning the Quadruple Roman Domination Problem in Graphs
by: Palagiri, V. S. R., et al.
Published: (2024)

Babai Numbers and Babai Spectra of Paths and Cycles
by: Johnson, Peter, et al.
Published: (2024)

Carathéodory Number in Cycle Convexity
by: Nair, Revathy S., et al.
Published: (2026)

On the Number of Path Systems
by: Cizma, Daniel, et al.
Published: (2025)

Geochromatic Number when Crossings are Independent
by: Boutin, Debra, et al.
Published: (2024)

Parameterized complexity of $r$-Hop, $r$-Step, and $r$-Hop Roman Domination
by: Das, Sandip, et al.
Published: (2026)

On decycling and forest numbers of Cartesian products of trees
by: Ghalavand, Ali, et al.
Published: (2025)

Projective Planar Cartesian Products of Graphs
by: Abell, Nicholas, et al.
Published: (2025)

The Turán number of the Cartesian product of a star and an edge
by: Zhao, Xiamiao, et al.
Published: (2026)

Paired Disjunctive Domination Number of Middle Graphs
by: Golpek, Hande Tuncel, et al.
Published: (2025)

Hamiltonicity of Cartesian products of graphs
by: Ladinek, Irena Hrastnik, et al.
Published: (2024)

The Alon-Tarsi Number of Cartesian product and Corona product of Hypercube Graph and Special Graphs
by: Li, Zhiguo, et al.
Published: (2025)

Betti Numbers of Cut Complexes of Squared Paths and a Recurrence Conjecture
by: Zhang, Yutong, et al.
Published: (2026)

Toroidal Cartesian Products Where One Factor is 3-Connected
by: Badgett, Elizabeth, et al.
Published: (2025)

Independent Bondage Number in Graphs under Girth Constraints
by: Gamlath, E. G. K. M., et al.
Published: (2024)

An Efficiently Computable Lower Bound for the Independence Number of Hypergraphs
by: Aldi, Marco, et al.
Published: (2025)

New Bounds on the Anti-Ramsey Number of Independent Triangles
by: Lu, Hongliang, et al.
Published: (2025)

Constructing edge-disjoint Steiner trees in Cartesian product networks
by: Li, Rui, et al.
Published: (2023)

Proper Rainbow Saturation Numbers for Cycles
by: Halfpap, Anastasia, et al.
Published: (2024)

Cartesian products of graphs and their coherent configurations
by: Cai, Jinzhuan, et al.
Published: (2024)

The Connected Bipartite Turán Problem for Long Cycles and Paths
by: He, Zhen, et al.
Published: (2025)