SelectedWorks - Colton Magnant

Contact

Selected Works of Colton Magnant

Associate Professor, Department of Mathematical Sciences, College of Science and Mathematics

Colton Magnant is an Associate Professor in the College of Science and Mathematics, Department of Mathematical Sciences on the Statesboro Campus of Georgia Southern University.

Works
About

×

About Colton Magnant

Colton Magnant is an Associate Professor in the College of Science and Mathematics, Department of Mathematical Sciences on the Statesboro Campus of Georgia Southern University.

Proper Distance in Edge-Colored Hypercubes

Applied Mathematics and Computation (2017)

Eddie Cheng, Colton Magnant and Dhruv Medarametla

An edge-colored path is called properly colored if no two consecutive edges have the same color. An edge-colored graph is ...

On Two Conjectures About the Proper Connection Number of Graphs

Discrete Mathematics (2017)

Fei Huang, Xueliang Li, Zhongmei Qin, Colton Magnant, et al.

A path in an edge-colored graph is called proper if no two consecutive edges of the path receive the same ...

Forbidden Properly Edge-Colored Subgraphs that Force Large Highly Connected Monochromatic ...

Graphs and Combinatorics (2017)

Robert Katic, Colton Magnant and Pouria Salehi Nowbandegani

We consider the connected graphs G that satisfy the following property: If n≫m≫k are integers, then any coloring of the ...

Symplectic Meanders

Communications in Algebra (2017)

Vincent E. Coll, Matthew Hyatt and Colton Magnant

Analogous to the ��(n) case, we address the computation of the index of seaweed subalgebras of ��(2n) by introducing graphical ...

On Algorithms for Enumerating Subtrees of Hexagonal and Phenylene Chains

The Computer Journal (2017)

Yu Yang, Hongbo Liu, Hua Wang, Ansheng Deng, et al.

As one of the counting-based topological indices, the number of subtrees and its variations has received much attention in recent ...

Placing Specified Vertices at Precise Locations on a Hamiltonian Cycle

Graphs and Combinatorics (2017)

Ronald Gould, Colton Magnant and Pouria Salehi Nowbandegani

Sharp minimum degree and degree sum conditions are proven for the existence of a Hamiltonian cycle passing through specified vertices ...

Monochromatic Connectivity in Monochromatic-Star-Free Graphs

Journal of Combinatorial Mathematics and Combinatorial Computing (2016)

Colton Magnant and Pouria Salehi Nowbandegani

We consider edge-colorings of complete graphs in which each color induces a subgraph that does not contain an induced copy ...

Note on Vertex and Total Proper Connection Numbers

AKCE International Journal of Graphs and Combinatorics (2016)

Emily C. Chizmar, Colton Magnant and Pouria Salehi Nowbandegani

This note introduces the vertex proper connection number of a graph and provides a relationship to the chromatic number of ...

Graph Linkedness With Prescribed Lengths

International Journal of Graph Theory and its Applications (2016)

Vincent E. Coll, Alexander Halperin and Colton Magnant

Given a multigraph H, a graph G is H-linked if every injective map f : V (H) -> V (G) ...

Note on Semi-Linkage with Almost Prescribed Lengths in Large Graphs

Graphs and Combinatorics (2016)

Emily C. Chizmar, Colton Magnant and Pouria Salehi Nowbandegani

We prove a sharp connectivity and degree sum condition for the existence of a subdivision of a multigraph in which ...

Directed Proper Connection of Graphs

Matematički Vesnik (2016)

Colton Magnant, Patrick R Morley, Sarabeth A Porter, Pouria Salehi Nowbandegani, et al.

An edge-colored directed graph is called properly connected if, between every pair of vertices, there is a properly colored directed ...

Path Partitions of Almost Regular Graphs

Australasian Journal of Combinatorics (2016)

Colton Magnant, Hua Wang and Shuai Yuan

The path partition number of a graph is the minimum number of paths required to partition the vertices. We consider ...

Minimum Degree and Even Cycle Lengths

Bulletin of the Institute of Combinatorics and its Applications (2016)

Ralph J. Faudree, Ronald Gould, Michael S. Jacobson and Colton Magnant

A classic result of Dirac states that if G is a 2-connected graph of order n with minimum degree δ ...

Tight Super-Edge-Graceful Labelings of Trees and Their Applications

AKCE International Journal of Graphs and Combinatorics (2015)

Alex Collins, Colton Magnant and Hua Wang

The concept of graceful labeling of graphs has been extensively studied. In 1994, Mitchem and Simoson introduced a stronger concept ...

Which Tree Has the Smallest ABC Index among Trees with ...

Discrete Applied Mathematics (2015)

Colton Magnant, Pouria Salehi Nowbandegani and Ivan Gutman

Given a graph G, the atom–bond connectivity (ABC) index is defined to be ABC (G) = ∑u~v √ d(u)+d(v)-2/d(u)d(v) where ...

Meander Graphs and Frobenius Seaweed Lie Algebras II

Journal of Generalized Lie Theory and Applications (2015)

Vincent Coll, Matthew Hyatt, Colton Magnant and Hua Wang

We provide a recursive classification of meander graphs, showing that each meander is identified by a unique sequence of fundamental ...

Monochromatic Structures in Edge-Coloured Graphs and Hypergraphs - A Survey

International Journal of Graph Theory and its Applications (2015)

Shinya Fujita, Henry Liu and Colton Magnant

Given a graph whose edges are coloured, on how many vertices can we find a monochromatic subgraph of a certain ...

General Bounds on Rainbow Domination Numbers

Graphs and Combinatorics (2015)

Shinya Fujita, Michitaka Furuya and Colton Magnant

A k-rainbow dominating function of a graph G is a function f from the vertices V(G) to 2{1,2,…,k} such that, ...

Rainbow K-Connection in Dense Graphs

Journal of Combinatorial Mathematics and Combinatorial Computing (2015)

Shinya Fujita, Henry Liu and Colton Magnant

An edge-colouring of a graph G is rainbow k-connected if, for any two vertices of G, there are k internally ...

Density of Gallai Multigraphs

Electronic Journal of Combinatorics (2015)

Diwan and Mubayi asked how many edges of each color could be included in a 33-edge-colored multigraph containing no rainbow ...

ABC Index of Trees with Fixed Number of Leaves

MATCH Communications in Mathematical and in Computer Chemistry (2015)

Mikhail Goubko, Colton Magnant, Pouria Salehi Nowbandegani and Ivan Gutman

Given a graph G, the atom-bond connectivity (ABC) index is defined to be ABC(G) = P uv∈E(G) qdG(u)+dG(v)−2 dG(u) dG(v) ...

Graphs Obtained from Collections of Blocks

Electronic Journal of Graph Theory and Applications (2015)

Colton Magnant, Pouria Salehi Nowbandegani and Hua Wang

Given a collection of d-dimensional rectangular solids called blocks, no two of which sharing interior points, construct a block graph ...

On Large Semi-Linked Graphs

Discrete Mathematics (2015)

Alexander Halperin, Colton Magnant and Hua Wang

Let H be a multigraph, possibly with loops, and consider a set S⊆V(H). A (simple) graph G is (H,S)-semi-linked if, ...

Properly Colored Notions of Connectivity - A Dynamic Survey

Theory and Applications of Graphs (2015)

Xueliang Li and Colton Magnant

Sheehan conjectured in 1975 that every Hamiltonian regular simple graph of even degree at least four contains a second Hamiltonian ...

Results and Problems on Saturation Numbers for Linear Forests

Bulletin of the Institute of Combinatorics and its Applications (2015)

Guantao Chen, Jill R. Faudree, Ralph J. Faudree, Ronald Gould, et al.

A graph G is called H-saturated if G contains no copy of H, but for any edge e in the ...