Showing 2024Show all
2 papers · 1 filter
math.CO2024
Upper bounds on the -isolation number
Peter Borg, Magdalena Lemańska, Mercè Mora +1
The isolation number of a graph (also called the vertex-edge domination number of ), denoted by , is the size of a smallest subset of the vertex set of …
math.CO2024
Antimagic and product antimagic graphs with pendant edges
Mercè Mora, Joaquín Tey
Let be a simple graph of size and a set of distinct real numbers. An -labeling of is a bijection . We say that is an antimagic…