Graphs of scramble number two
R Eagleton, R Morrison - Discrete Mathematics, 2023 - Elsevier
The scramble number of a graph provides a lower bound for gonality and an upper bound
for treewidth, making it a graph invariant of interest. In this paper we study graphs of …
for treewidth, making it a graph invariant of interest. In this paper we study graphs of …
[PDF][PDF] Brief Discussion on Maximal Edge-Ideal in Graph Theory
T Fujita - Preprint - researchgate.net
1 Brief Discussion on Maximal Edge-Ideal in Graph Theory Takaaki Fujita Affiliation:Independent
Email:t171d603@gunma-u.ac.jp Abs Page 1 1 Brief Discussion on Maximal Edge-Ideal in …
Email:t171d603@gunma-u.ac.jp Abs Page 1 1 Brief Discussion on Maximal Edge-Ideal in …
Fibonacci Sumsets and the Gonality of Strip Graphs
D Jensen, DR Laboy - arXiv preprint arXiv:2408.09247, 2024 - arxiv.org
We provide a new perspective on the divisor theory of graphs, using additive combinatorics.
As a test case for this perspective, we compute the gonality of certain families of outerplanar …
As a test case for this perspective, we compute the gonality of certain families of outerplanar …
[PDF][PDF] Edge-UltraFilter and Edge-Tangle for graph
T Fujita - researchgate.net
The investigation of width parameters in both graph theory and algebraic contexts has
attracted considerable attention. Among these parameters, tree-cut-decomposition has …
attracted considerable attention. Among these parameters, tree-cut-decomposition has …