Zobrazeno 1 - 1
of 1
pro vyhledávání: '"Vora, Sumi"'
Autor:
Berg, Jake, Chang, Perryn, Kaneshiro, Claire, Kuenzel, Kirsti, Pellico, Ryan, Renteria, Isabel, Vora, Sumi
A set of edges $F$ in a graph $G$ is an edge dominating set if every edge in $G$ is either in $F$ or shares a vertex with an edge in $F$. $G$ is said to be well-edge-dominated if all of its minimal edge dominating sets have the same cardinality. Rece
Externí odkaz:
http://arxiv.org/abs/2412.10926
