An Improved Bound for Upper Domination of Cartesian Products of Graphs
Abstract
In this paper, we prove a problem proposed by Bresar: for any graphs G and H, (G H)(G)(H)+ \|V(G)|-(G),|V(H)|-(H)\, where (G) denotes the upper domination number of G.
0
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.