arXiv (All)
open access
A $2/3$ Bound for Vizing's Conjecture
Vizing's conjecture, dating back to 1963, asserts that \[ γ(G\mathbin{\square}H) \geq γ(G)γ(H) \] for all finite graphs $G$ and $H$, where $γ$ denotes the domination number and $\square$ denotes the Cartesian product. In 2000, Clark and Suen proved the universal bound \[ γ(G\mathbin{\square}H) \geq
Conceptio Open Archive
Analyze & explore related research in Conceptio
Connect this record directly into your research workflow or AI agent. Explore citations across open repositories, query full text, and export structured proof bundles.
This document is indexed with metadata only: full text is not available in the archive for this record. Open the official source ↗
Related documents
- Further results on \([k]\)-Roman domination on cylindrical grids \(C_m \Box P_n\)#1076842
- Stability of the Strong Domination Number of Graphs#793545
- Stability of the Strong Domination Number of Graphs#789541
- Upper bounds for double Roman domination and $[k]$-Roman domination of cylindrical graphs $C_m \Box P_n$#1076857
- Quasi-strongly regular digraphs constructed from transitive groups of degree $n\leq 110$#996991
Record · ID 997511
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Bring this data into your agent: Connect via MCP or API · 20 free credits to start · no card required
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive