Some improved inequalities related to Vizing's conjecture
From MaRDI portal
Publication:1708275
DOI10.1016/j.ipl.2018.03.003zbMath1476.05159OpenAlexW2791120575WikidataQ123237603 ScholiaQ123237603MaRDI QIDQ1708275
Fu-Tao Hu, Lidan Pei, Xiang-Feng Pan
Publication date: 5 April 2018
Published in: Information Processing Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ipl.2018.03.003
combinatorial problemsVizing's conjecturedomination numberCartesian product graphRoman domination number
Related Items
On construction for trees making the equality hold in Vizing's conjecture ⋮ Proofs of the AutoGraphiX conjectures on the domination number, average eccentricity and proximity
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- An improved inequality related to Vizing's conjecture
- Roman domination number of the Cartesian products of paths and cycles
- Vizing's conjecture for graphs with domination number 3 -- a new proof
- Vizing's conjecture for chordal graphs
- A result on Vizing's conjecture
- Roman domination in graphs.
- An inequality related to Vizing's conjecture
- An improvement on Vizing's conjecture
- Defendens Imperium Romanum: A Classical Problem in Military Strategy
- On Clark and Suen bound-type results fork-domination and Roman domination of Cartesian product graphs
- Vizing's conjecture: a survey and recent results
- Graph-theoretic parameters concerning domination, independence, and irredundance
- Fair reception and Vizing's conjecture
- On the domination of the products of graphs II: Trees
- Theory and Application of Graphs
- A characterization of Roman trees
- The domination numbers of the 5 × n and 6 × n grid graphs
- Vizing's conjecture and the one-half argument
- Roman domination in Cartesian product graphs and strong product graphs
