Colton Magnant

activity

20102026

most citedTotal rainbow connection of digraphs

23 citations · 67 across the 24 of their papers we have counts for

collaborators

Showing 2016Show all

8 papers · 1 filter

math.CO2016

Distance proper connection of graphs and their complements

Xueliang Li, Colton Magnant, Meiqin Wei +1

Let $G$ be an edge-colored connected graph. A path $P$ in $G$ is called a distance $ℓ$ -proper path if no two edges of the same color can appear with less than $ℓ$ edges in be…

math.CO2016★ 4 cited

Distance proper connection of graphs

Xueliang Li, Colton Magnant, Meiqin Wei +1

Let $G$ be an edge-colored connected graph. A path $P$ in $G$ is called a distance $ℓ$ -proper path if no two edges of the same color appear with fewer than $ℓ$ edges in betwe…

math.RA2016

The unbroken spectrum of type-A Frobenius seaweeds

Vincent E. Coll, Matthew Hyatt, Colton Magnant

If $g$ is a Frobenius Lie algebra, then for certain $F \in g^{*}$ the natural map $g ⟶ g^{*}$ given by $x ⟼ F [x, -]$ i…

math.CO2016★ 1 cited

The $(k, ℓ)$ -proper index of graphs

Hong Chang, Xueliang Li, Colton Magnant +1

A tree $T$ in an edge-colored graph is called a {\it proper tree} if no two adjacent edges of $T$ receive the same color. Let $G$ be a connected graph of order $n$ and $k$ be an in…

math.CO2016

Bounds on the connected forcing number of a graph

Randy Davila, Michael Henning, Colton Magnant +1

In this paper, we study (zero) forcing sets which induce connected subgraphs of a graph. The minimum cardinality of such a set is called the connected forcing number of the graph.…

math.CO2016★ 1 cited

On two conjectures about the proper connection number of graphs

Fei Huang, Xueliang Li, Zhongmei Qin +2

A path in an edge-colored graph is called proper if no two consecutive edges of the path receive the same color. For a connected graph $G$ , the proper connection number $p c (G)$ of…

math.CO2016

Solution to a conjecture on the proper connection number of graphs

Fei Huang, Xueliang Li, Zhongmei Qin +1

A path in an edge-colored graph is called a proper path if no two adjacent edges of the path receive the same color. For a connected graph $G$ , the proper connection number $p c (G)$ …

math.RA2016

Symplectic meanders

Vincent E. Coll, Matthew Hyatt, Colton Magnant

Analogous to the sl(n) case, we address the computation of the index of seaweed subalgebras of sp(2n) by introducing graphical representations called symplectic meanders. Formulas…

Distance proper connection of graphs and their complements

Distance proper connection of graphs

The unbroken spectrum of type-A Frobenius seaweeds

The (k,ℓ)-proper index of graphs

Bounds on the connected forcing number of a graph

On two conjectures about the proper connection number of graphs

Solution to a conjecture on the proper connection number of graphs

Symplectic meanders

The $(k, ℓ)$ -proper index of graphs