Jul 27, 2021 · We introduce the multiplicity-free gonality of a graph, which restricts our consideration to divisors that place at most \(1\) chip on each vertex.
We also prove that multiplicity-free gonality is NP-hard to compute, while still determining it for graph families for which gonality is currently unknown. We ...
The divisorial gonality of a graph is the minimum degree of a positive rank divisor on that graph. We introduce the multiplicity-free gonality of a graph, ...
Jan 29, 2023 · We also prove that multiplicity-free gonality is NP-hard to compute, while still determining it for graph families for which gonality is.
People also ask
How do you show multiplicity on a graph?
What does a zero with an even multiplicity mean for a graph?
Jul 27, 2021 · To determine which wheel graphs have multiplicity-free gonality equal to gonality, we must first determine the gonality of Wn. Theorem 5.2.
People also search for
"In this thesis we study a new graph invariant which we call multiplicity-free gonality, a relative of divisorial gonality where we are restricted to ...
Oct 22, 2024 · The divisorial gonality of a graph is the minimum degree of a positive rank divisor on that graph. We introduce the multiplicity-free gonality ...
Multiplicity-free gonality on graphs. Electron. J. Graph Theory Appl. (EJGTA), 11(2):357–380, 2023. [Die18]. Reinhard Diestel. Graph theory, volume 173 of ...
Mar 31, 2022 · In this paper we prove that scramble number is NP-hard to compute, also providing a proof that computing gonality is NP-hard even for simple graphs, as well as ...
我们引入了图的无多重性，这限制了我们对每个顶点上最多放置1个芯片的除法的考虑。我们从顶点连通性的角度给出了这两个版本的共向性相等的充分条件;并且证明了没有任何函数 ...