Southeastern International Conference on Combinatorics, Graph Theory & Computing

Archived Abstracts

52nd Conference

51st Conference

50th Conference


52nd SEICCGTC Abstracts

 

Contributed Papers

 
Abrams, Lowell

George Washington University

The Wiener Ratio for Embedded Graphs

Abudayah, Mohammad 

German Jordanian University

On the  w-hermitian adjacency matrix

Abueida, Atif

University of Dayton

Decomposition of the Johnson Graphs into Graph-Pairs of order 4

Agrinsoni, Carlos

University of Puerto Rico Rio Piedras

An Explicit Characterization of Factorization of a Large Class of Multivariate  Polynomials in terms of Absolutely Irreduble Factors over Finite Fields

Akhtar, Yasmeen 

Arizona State University

Mixed Covering, Locating, and Detecting Arrays via Cyclotomy

Almodovar, Leyda

Stonehill College

DNA Self-Assembly: Complete Tripartite Graphs

Alochukwu, Alex 

University of Johannesburg

Bounds on the (Edge)-Fault-Diameter of Bipartite C4-free Graphs

Anantapantula, Saranya 

Spring-Ford Area High School

Structural properties of  K  M   N

Archana, S.  Calicut University

Semigraph

Arrieta, Eddie University of Puerto Rico-Rio Piedras

Application of our GO-UP Construction to Goppa Codes to Construct Quantum Error-Correcting Codes

Arroyo, Andres   University of Puerto Rico-Rio Piedras

An Implementation of McEliece Public Key Cryptosystems for Post-Quantum Cryptography Using AG Codes and Analysis

Arumugam, S. Kalasalingam Academy of Research and Education

Local Antimagic Edge Labeling of a Graph

Aspenson, Grace University of Minnesota Duluth

Decomposing complete graphs into unicyclic bipartite graphs with nine edges

Bagga, Jay Ball State University

Graceful Labelings of Unicyclic Graphs

Baker, Dustin University of Minnesota, Duluth

Decomposition of  Kn   Into Connected Unicyclic Tripartite Graphs With 9 Edges

Balasubramanian, Suman  DePauw University

On Certain Centrality Measures on Rooted Networks

Baloda, Barkha Birla Institute of Technology and Science Pilani

On the Graphs associated with ideals of Semigroups

Bandpey, Zeinab Morgan State University

The number of graph homomorphisms between cycles and cycles with loops,
A problem from Stanley's 1986 text  Enumerative Combinatorics

Bardenova, Viktoriya Florida Gulf Coast University

Tipsy Cop and Tipsy Robber: a Variation of Cops and Robbers Game

Barrett, Wayne Brigham Young University

The Inverse Eigenvalue Problem of a Graph, An Overview

Barrus, Michael University of Rhode Island

Distinguishing chromatic numbers of circulant graphs

Bartz, Jeremiah University of North Dakota

Powers of Two as Sums of Two Balancing Numbers

Baskoro, Edy Tri Institut Teknologi Bandung

Conjectures on the Total Vertex-irregularity Strength of Graphs

Baumann, Stacie Auburn University

Equitable  (s; p)-edge-colorings of  Kv

Beasley, LeRoy Utah State University

Graph Cordiality-Extremes and Preservers

Bednar, Victoria Virginia Commonwealth University

Rainbow Turan Numbers

Benakli, Nadia  New York City College of Technology, CUNY

The Threshold Strong Dimension of Trees

Betten, Anton Colorado State University

Better CRC Polynomials for Internet Error Detection

Bhoumik, Soumya  Fort Hays State University

L(h, k)-Labeling of Circulant Graphs

Bickle, Allan Penn State Altoona

Properties of Sierpinski Triangle Graphs

Bjorkman Morrison, Beth  AFRL

Non-Asymptotic Connectivity of Random Graphs and Their Unions

Blanco, Saul A.  Indiana University

Generalized Pancake Graphs

Brown, Jason I. Dalhousie University

Recent Results in Network Reliability

Brudnak, Joshua Oakland University

Connectivity Properties of Generalized Hypercubes

Buchanan, Calum University of Vermont

Expressing graphs as symmetric differences of cliques of the complete graph

Buehrle, Charles

 Notre Dame of Maryland University

Presentations of Coxeter groups of type  A, B,  and  D  using prefix-reversal generators

Bunge, Ryan

 Illinois State University

Maximum packings of complete 3-uniform hypergraphs into a 2-regular hyper   graph

Bushaw, Neal 

Virginia Commonwealth University

Bootstrap Percolation and Automated Conjecturing

Byers, Alexis Youngstown State University

Harmonious Colorings of Graphs

Carbonero, Alvaro University of Nevada, Las Vegas

Decoding Convergence: Tracing the sequences of H-Line Graphs

Carlson, Joshua Williams College

Zero Forcing and Throttling on Directed Graphs

Carrigan, Braxton Southern Connecticut State University

Magic Sudoku Pair Latin Squares

Charles, Courteney  Howard University

Constructing Clifford graph algebras for special classes of trees

Che, Zhongyuan Penn State University Beaver 

Dimensional  k-Wiener index of a  k-plex

Clark, James Florida Atlantic University

Behavioral Analysis of Artificial Neural Networks

Conrad, Esther  Iowa State University

Positive Semidefinite Product Throttling

Curran, Stephen University of Pittsburgh at Johnstown

C4-face-magic labelings on projective grid graphs

Dalal, Sandeep

Birla Institute of Technology and Science Pilani, Pilani, India

Structure of Cyclic Graph on Semigroup

Dankelmann, Peter

University of Johannesburg

Metric dimension of bipartite graphs

Daven, Mike

Mount Saint Mary College

Decomposition of the Johnson Graphs into Graph-Pairs of order 4

Deaett, Louis 

Quinnipiac University

Minimum rank bounds for matrix patterns and graphs

DeDeo, Michelle

University of North Florida & Mayo Clinic Collaborator

Odd Perfect Numbers: A Computational Sandbox

Difulvio, Lena

Washington & Jefferson College

Cuspidal Ribbon Tableaux

Dougherty, Ryan

United States Military Academy West Point

Algorithmic Methods for Covering Arrays of Higher Index

Draper, Richard Center for Computing Sciences, Institute for Defense Analyses

Graph Constructions Derived from Interconnection Networks

El-Zanati, Saad Illinois State University

On  k-factorizations of complete uniform hypergraphs of small order

Emamy-K., M.R. University of Puerto Rico Rio Piedras

On a Convex Geometric Connection to Threshold Logic

Erey, Aysel  Gebze Technical University

Distance matrices and 4-chromatic planar graphs

Erickson, Craig 

Hamline University

Restricted power domination

Evans, Anthony Wright State University

The existence problem for strong complete mappings of finite groups

Fajardo Gomez, Lina

University of South Florida

Prodsimplicial and p-path complexes on directed graphs

Farahani, Mozhgan Memorial University of Newfoundland

Capturing robbers by deduction

Fickes, Grant University of South Carolina

Sequence Recurrence Ranks

Fleischmann, Henry University of Michigan

Conditions for Efficient  (j, k)-Domination

Flemings, James University of Alaska Anchorage

Modular monochromatic (3, t)-colorings

Florez, Rigoberto The Citadel

A relation between non-decreasing Dyck paths and Riordan arrays

Freyberg, Bryan University of Minnesota Duluth

Neighborhood face-magic labelings of two classes of graphs

Froncek, Dalibor University of Minnesota Duluth

(T,D)-Distance Magic Labeling of Some Cubic Graphs

Furst, Veronika Fort Lewis College

The inverse eigenvalue problem of a graph from a frame theoretic viewpoint

Ganzhinov, Mikhail  Aalto University

Infinite family of optimal line systems

Garnett, Colin  Black Hills State University

A Reducible SAP With 2n-1 nonzero entries

Gismondi, Steve University of Guelph

Complexity Class Boundaries and Incremental Changes to the Birkhoff Polytope

Godbole, Anant East Tennessee State University

The Expected Number of Distinct Consecutive Patterns in a Random Permutation

Gonzalez-Albino, Lillian University of Puerto Rico, Rio Piedras

Involutions of  Fq    Obtained From Binomials of the Form  xm(xq-1/2+a)

Gopalakrishnan, K. East Carolina University

A note on the (in)security of a stream cipher based on Gopala-Hemachandra Codes

Gupta, Sambhav Northville High School

Conditional fractional matching preclusion of pancake graphs

Hadaway, Kimberly P. Williams College

An Introduction to Parking Functions

Hasni, Roslan Universiti Malaysia Terengganu

Edge Irregular Reflexive Labeling in Graphs

Heenehan, Megan

Eastern Connecticut State University

Immersions of Cliques in Graph Products

Heinlein, Daniel

Aalto University

Steiner Triple Systems of Order 21 with Subsystems

Holliday, Sarah

Kennesaw State University

Distinct Representatives in Special Set Families in Graphs

Hook, Jonelle 

Mount St. Mary’s University

Recent developments of star-critical Ramsey numbers

Hurlbert, Glenn

Virginia Commonwealth University

The Target Pebbling Conjecture

Imrona, Mahmud 

Institut Teknologi Bandung

The RVCL of Comb Product of a Graph and a Complete Graph

Jacob, Bonnie

Rochester Institute of Technology

The zero forcing span of a graph

Janwa, Heeralal

University of Puerto Rico, Rio Piedras

Resolution of a Conjecture on an Upper Bound on The Covering Radius of a Linear Code over F   q

Johnston, Daniel

Skidmore College

Rainbow Saturation

Karaoglu, Fatma

Tekirdag Namik Kemal University, Turkey

Non-Singular cubic surfaces over F2k

Kempner, Yulia

Holon Institute of Technology

Cospanning Characterizations of Combinatorial Structures

Kempton, Mark  

Cospectral Vertices and Quantum State Transfer

Kenter, Franklin H. J. 

United States Naval Academy

Zero forcing parameters, the ordered multiplicity inverse eigenvalue sequence problem for graphs and powers of graphs

King, Zachary

University of Central Oklahoma

Counting Vertices in Interated Line Graphs

Misha Klopukh, Misha 

Florida Atlantic University

Hyperdimensional Turing Machines

Kong, Nayeong 

Indiana University East

On Certain Centrality Measures on Rooted Networks

Korchmaros, Annachiara 

Aalto University

Bi-transitive bipartite graphs and genes

Lane-Harvard, Liz

University of Central Oklahoma

Miscellaneous New Strongly Regular Graphs from Generalized Quadrangles

Larson, Craig Virginia Commonwealth University

Deming Decompositions of Graphs

Lau, Gee-Choon Universiti Teknologi MARA

On Local Antimagic Chromatic Number of Spider Graphs

Lauderdale, L. K.  Towson University

On the fixing sets of symmetric groups

Lee, Sooyeon University of Mississippi

On graphs with a small circuit spectrum

Levene, Rupert University College, Dublin

Orthogonal symmetric matrices on the join of two graphs

Levit, Vadim E. Ariel University

Inequalities Connecting the Annihilating and Independence Numbers

Loos, Gabriel Georgia Southern University

On Cyclic Compositions and Their Parts

Lorch, John Ball State University

Counting Rokudoku-Pair Squares

Lusi, Dylan  Arizona State University

Constructing Resolutions for an Infinite Family of Bose Triple Systems

Low, Richard San Jose State University

C4-face-magic Polyominoes in the Plane

Luttrell, Kristi Seton Hall University

Weighted Component Order Edge Connectivity for the Complete Bipartite Graph

Malavadkar, P.P.  MIT World Peace University

The es-Splitting operation for matroids representable over prime fields  GF(p)

Markenzon, Lilian NCE - Universidade Federal do Rio de Janeiro, Brazil

Multi-core Graphs: Characterization and Properties

Marr, Alison Southwestern University

D-Magic Oriented Graphs

Martin, Jo University of Vermont

Guessing Numbers and Extremal Graph Theory

Martin, William Worcester Polytechnic Institute

Quantum Walks on Graphs and Group State Transfer

McColm, Greg University of South Florida

Cut-and-Project Graphs

Melendez Rios, Gustavo University of Puerto Rico, Rio Piedras

ST-Modular and ST-Distributive Lattices

Meyer, Seth St. Norbert College

Symmetric Orthogonal Representations for Cayley Graphs

Meyerowitz, Aaron Florida Atlantic University

Sprague-Grundy Functions for Divisor Graphs

Mishna, Marni Simon Fraser University

The Kaleidoscopic Splendour of Lattice Walk Enumeration

Mohammed, Abdulmelik  University of South Florida

Knotted and Unknotted Eulerian Circuits on Graphs Embedded in Surfaces

Mousley, Jonathan Utah State University

(2,3)-Cordial Oriented Hypercubes

Mukherjee, Antara The Citadel

Families of Integral Cographs within a Triangular Array

Myers, Timothy Howard University

An Equivalence Class Construction of Clifford Graph Algebras

Narayan, Darren Rochester Institute of Technology

Isomorphisms Between Point-block Incidence Graphs

Newman, N.A. Troy University

Coloring Complete, Uniform, Circular, Mixed Hypergraphs

Noble, Matt  Middle Georgia State University

PRCF-bad Graphs of Higher Girth

Oblak, Polona University of Ljubljana

Number of distinct eigenvalues of joins of unions of complete graphs

Pardalos, Panos University of Florida

Inverse Combinatorial Optimization Problems

Pham, Andrew University of Mississippi

Independent Bondage Number for Planar Graphs

Piero, Fernando University of Puerto Rico, Ponce

Error-Correcting Codes for Quantum Computers (Binary and Quaternary) from
Subfield of Subcodes of AG codes and their Parameters

Praeger, Cheryl University of Western Australia

Finite edge-transitive Cayley graphs, quotient graphs and Frattini groups

Ramirez, Jose Universidad Nacional de Colombia

Some Combinatorial Statistics over Catalan Polyominoes

Ramos, Andres University of Puerto Rico, Rio Piedras

Differences of Functions with the Same Value Set

Ray, Subhosit Florida Atlantic University

Compressed-Inference: Reinforcement Learning with Random Projections

Raza, Zahid University of Sharjah, UAE

Expected values of some molecular descriptors in random phenylene chain

Reyes Carranza, Roberto Uuniversity of Puerto Rico Mayagüez

New Efficient Differentially &-Uniform Functions

Rimal, Binod Florida Atlantic University

Fault Diagnosis with LSTM on Compressed Time-Series

Rimal, Ramchandra  Middle Tennessee State University

Sparse Popularity Adjusted Stochastic Block Model

Roblee, Ken Troy University

Nonexistence of a Subfamily of a Family of Edge-Regular Graphs

Saccoman, John T. Seton Hall University

A Spanning Tree-Reducing Surgery and Partial Factor Majorization

Sagan, Bruce Michigan State University

On a rank-unimodality conjecture of Morier-Genoud and Ovsienko

Salehi, Ebrahim University of Nevada Las Vegas

On Subset Labelings of Trees

Santana, Manuel Utah State University

(2,3)-Cordial Trees and Paths

Santiago, Javier University of Puerto Rico Rio Piedras

Permutation binomials of index qe-1+...+q+1 over Fqe

Schillewaert, Jeroen

University of Auckland, New Zealand

Wednesday:  Constructing highly regular expanders from hyperbolic Coxeter
Schillewaert, Jeroen

University of Auckland, New Zealand

Thursday: Small maximal independent sets
Schmidt, James Michigan State University

A Cyclic Variant of the Erdos-Szekeres Theorem

Schmitt, John Middlebury College

New methods to attack the Buratti-Horak-Rosa conjecture

Schwieder, Coy University of Minnesota Duluth

Decomposition of  K18n   into Isomorphic Unicyclic Tripartite 9-Edge Graphs

Sciriha, Irene  University of Malta, Msida, Malta

On the walks and CDC of graphs with the same main eigenspace

Seo, Suk Middle Tennessee State University

Fault-tolerant locating-dominating sets in cubic graphs

Shader, Bryan University of Wyoming, Laramie

Sign patterns of orthogonal matrices

Shader, Bryan University of Wyoming, Laramie

The minimum number of distinct eigenvalues of a matrix with a given graph

Shahrokhi, Farhad  University of North Texas

Revisiting domination number of trees

Shen, Chenli  Southeast University

Fashion game on graphs

Sholtes, Isabella Washington & Jefferson College

Cuspidal Ribbon Tableaux

Simanjuntak, Rinovia  Tamaro Nadeak, Institut Teknologi Bandung

Centroidal Dimension of Product Graphs

Small, Ben  

A Counterexample to a Conjecture on PSD Propagation Time

Smigoc, Helena  University College Dublin

Paths are generically realisable

Smith, Logan Rice University

An Integer Program for Positive Semidefinite Zero Forcing in Graphs

Stinson, Doug University of Waterloo

On partial parallel classes in partial Steiner triple systems

Su, Hsin-Hao Stonehill College

On Graceful Spectra of Graphs

Tittman, Peter Mittweida University of Applied Sciences

Counting in Graphs: An Invitation to Graph Polynomials

Tomasko, Jessica Penn State Altoona

Fibonacci colored compositions and their applications

Torres, Jaziel

University of Puerto Rico at Rio Piedras

Computation and Analysis of the Multidimensional Linear Complexity of Periodic Arrays

Tranel, Theodore Iowa State University

Incidence profiles of partial geometric designs with small block size

Turner, William Illinois State University

On decompositions of complete 4-uniform hypergraphs into a 2-regular 4-cycle

Vaidya, Sanju Mercy College

Sharp Bounds for Generalized Zagreb Indices of Graphs

Vangipuram, A. Novi High School

Extraconnectivities of augmented cubes

Vargas, Carbonero SUNY, Fredonia, UNLV

Removing Symmetry in Circulant Graphs and Point-Block Incidence Graphs

Velazquez, Jose University of Puerto Rico, Rio Piedras

Boolean Bent and Near-Bent Function Construction and 2 Error-Correcting Codes

Walker, Shanise

University of Wisconsin-Eau Claire

Zero Forcing, Power Domination, and Product Power Throttling of a Graph

Wang, Hua

Georgia Southern University

Tilings and restricted n-color compositions

Whitman, Rebecca

University of California, Berkeley

The Hereditary Closure of the Unigraphs

Winkler, Peter

Dartmouth College

Graphons and Permutons

Winkler, Peter

Dartmouth College

Probability in Your Head

Xue, Wayne

Clemson University

The Cycle Compelling Number of Graph

Yadav, Pinki

BITS, Pilani

An Algorithm For Customizing Slicing Floor Plan Design

Yatauro, Michael

Penn State Brandywine

A Parameterized Extension of the Binding Number

Yetim, Mehmet Akif

Suleyman Demirel University

Distance-2 coloring of graphs via vertex elimination schemes

Yosef, Ron

Software Architect, TSG IT Advanced Systems Ltd.

On Unimodality of Independence Polynomials of Trees

Zhao, Qinghong 

University of Mississippi

Ramsey and Gallai-Ramsey numbers for graphs related to kipas
 

Special Sessions                                       

 

 

Title: Graph Labelings

Organizer: Richard Low, San Jose State University

Arumugam, S Kalasalingam Academy of Research and Education

Local Antimagic Edge Labeling of a Graph

Low, Richard San Jose State University

C4-face-magic Polyominoes in the Plane

Bagga, Jay Ball State University

Graceful Labelings of Unicyclic Graphs 

Baskoro, Edy Tri Institut Teknologi Bandung

Conjectures on the Total Vertex-irregularity Strength of Graphs

Beasley, LeRoy Utah State University

Graph Cordiality-Extremes and Preservers

Byers, Alexis Youngstown State University

Harmonious Colorings of Graphs

Curran, Stephen

University of Pittsburgh at Johnstown C4-face-magic labelings on projective grid graphs
Freyberg, Bryan University of Minnesota Duluth

Neighborhood face-magic labelings of two classes of graphs

Froncek, Dalibor University of Minnesota Duluth

(T,D)-Distance Magic Labeling of Some Cubic Graphs

Lau, Gee-Choon

Universiti Teknologi MARA On Local Antimagic Chromatic Number of Spider Graphs

Marr, Alison

Southwestern University  D-Magic Oriented Graphs

Mousley, Jonathan

Utah State University (2,3)-Cordial Oriented Hypercubes

Salehi, Ebrahim

University of Nevada Las Vegas On Subset Labelings of Trees
Santana, Manuel Utah State University

(2,3)-Cordial Trees and Paths

Su, Hsin Hao

Stonehill College On Graceful Spectra of Graphs
 

Title:
The Inverse Eigenvalue Problem of a Graph and Zero Forcing                 

Organizers: Leslie Hogben, Iowa State University and AIM
                    Bryan Shader, University of Wyoming, Laramie

Bjorkman Morrison, Beth AFRL

Non-Asymptotic Connectivity of Random Graphs and Their Unions

Carlson, Joshua

Williams College Zero Forcing and Throttling on Directed Graphs
Conrad, Esther

Iowa State University

Positive Semidefinite Product Throttling
Erickson, Craig  Hamline University

Restricted power domination

Garnett, Colin

Black Hills State University

A Reducible SAP With 2n-1 nonzero entries
Jacob, Bonnie Rochester Institute of Technology

The zero forcing span of a graph

Kenter, Franklin H. J.

United States Naval Academy

Zero forcing parameters, the ordered multiplicity inverse eigenvalue sequence problem for graphs and powers of graphs
Levene, Rupert University College Dublin

Orthogonal symmetric matrices on the join of two graphs 

Meyer, Seth A. St. Norbert College

Symmetric Orthogonal Representations for Cayley Graphs

Small, Ben

 

A Counterexample to a Conjecture on PSD Propagation Time 

Smigoc, Helena

University College Dublin Paths are generically realisable

Smith, Logan

Rice University An Integer Program for Positive Semidefinite Zero Forcing in Graphs

 Walker, Shanise

University of Wisconsin-Eau Claire Zero Forcing, Power Domination, and Product Power Throttling of a Graph
 

Title: Undergraduate Research

Organizer: Darren Narayan, Rochester Institute of Technology
Anantapantula, Saranya 

Spring-Ford Area High School

Structural properties of K M   N
Aspenson, Grace

University of Minnesota Duluth

Decomposing complete graphs into unicyclic bipartite graphs with nine edges
Baker, Dustin

University of Minnesota Duluth

Decomposition of Kn    Into Connected Unicyclic Tripartite Graphs With 9 Edges
Bushaw, Neal

Virginia Commonwealth University

Bootstrap Percolation and Automated Conjecturing
Carbonero, Alvaro

University of Nevada Las Vegas

Decoding Convergence: Tracing the sequences of H-Line Graphs
Difulvio, Sholtes

Washington & Jefferson College

Cuspidal Ribbon Tableaux
Flemings, James

University of Alaska Anchorage

Modular monochromatic (3, t)-colorings
Gupta, Sambhav

Northville High School

Conditional fractional matching preclusion of pancake graphs

Hadaway, Kimberly P.

Williams College An Introduction to Parking Functions
King, Zachary

University of Central Oklahoma

Counting Vertices in Interated Line Graphs 
Ramos, Andres

University of Puerto Rico Rio Piedras

Differences of Functions with the Same Value Set
Santiago, Javier

The University of Puerto Rico Rio Piedras

Permutation binomials of index qe-1+...+q+1 over Fqe
Schweider, Coy

University of Minnesota Duluth

Decomposition of K18n    into Isomorphic Unicyclic Tripartite 9-Edge Graphs
Tomasco, Jessica

Penn State Altoona

Fibonacci colored compositions and their applications
Vangipuram, S.

Novi High School

Extraconnectivities of augmented cubes
Vargas, Carbonero

SUNY, Fredonia, UNLV

Removing Symmetry in Circulant Graphs and Point-Block Incidence Graphs
Yosef, Ron

Software Architect, TSG IT Advanced Systems Ltd.

On Unimodality of Independence Polynomials of Trees

Return to Top

51st SEICCGTC Abstracts

Abdallah, Mohamad American University of Kuwait

The Edge-Pancyclicity of Pancake Graph

Adachi, Tomoko Toho University

Critical sets of a magic square and its application

Alameda, Joseph Iowa State University

An Upper Bound for the k-Power Domination Number in Hypergraphs

Alm, Jeremy Lamar University

Generalizing p-goodness to ordered graph Ramsey numbers

Almodovar, Leyda  Stonehill College

Optimal pots for modular self-assembly

Alochukwu, Alex University of Johannesburg

Bounds on the (Edge)-Fault-Diameter of Bipartite C4-free Graphs

Anderson, Sarah

University of St. Thomas

On well-dominated graphs

Andrews, Eric University of Alaska, Anchorage

Modular monochromatic (3, t)-colorings

Bailey, Sean Texas A&M University

Combinatorially Orthogonal Paths 

Barrus, Michael University of Rhode Island

Graphs with few trivial characteristic ideals

Bartz, Jeremiah University of North Dakota

Ratio Balancing Numbers 

Benkali, Nadia New York City College of Technology, CUNY 

𝒌-Neighborhood Degree List of a Graph with Large Cycles

Betten, Anton Colorado State University

The Magliveras Problem

Bickle, Allan Penn State Altoona

Diameter of Maximal k-degenerate Graphs 

Bjorkman, Beth Iowa State University

Infectious power domination of hypergraphs

Blair, Howard USAF Research Laboratory, Rome, NY

Continuity, Differentiation and Quantum State Transfer in Discrete Structures

Blumenthal, Adam     Iowa State University 

Counterexamples to a Conjecture on Hall Ratio

Bok, Jan Charles University, Prague, Czech Republic

List homomorphism problem for signed graphs 

Budzsisz, Stephanie Oakland University

Projection of Polytope: an experiment in parallelism

Bushaw, Neal Virginia Commonwealth University

Rainbow Saturation

Butt, Saad Ihsan COMSATS University Islamabad, Lahore Campus, Pakistan

Omega, Sadhana and Padmakar-Ivan Polynomials for Some Chemical Graphs

Byers, Alexis Youngstown State University

Combining Graceful and Harmonious Labelings

Carrigan, Braxton

Southern Connecticut State University

Skolem Number of Graphs

Chan, W. H. The Education University of Hong Kong

Bulgarian Nim on more heaps

Che, Zhongyuan Penn State University, Altoona

Wiener indices of maximal k-degenerate graphs

Chen, Ketai Auburn University

An algorithm for counting binary Huffman sequences of specified length

Choi, Sul-young Le Moyne College

On the number of mappings with images of a fixed size

Collins, Karen L. Wesleyan University

The Distinguishing Chromatic Number of a Poset

Cone, Patrick Indiana University of Pennsylvania

Climbing the Branches of the Graceful Tree Conjecture

Couch, P. J. Lamar University

Association Schemes and Relation Algebras

Cruz, Dylan University of Puerto Rico, Rio Piedras

Functions on the Integers Modulo n

Curran, Stephen University of Pittsburgh at Johnstown

C4-face-magic labelings on Klein bottle checkerboards 

Dankelmann, Peter University of Johannesburg

Metric dimension of bipartite graphs

Das, Aparna Le Moyne College

On the anti-bandwidth sum of bipartite graphs

Davenport, Dennis Howard University

A&Z Sequences for Double Riodan Arrays

DeDeo, Michelle University of North Florida

Graph Energy in Interconnection Networks based on Cayley graphs of Permutation groups

Delgado, Moises University of Puerto Rico, Cayey Campus, PR

New candidates for high degree trapdoor functions over finite fields

Dowling, Alex Florida Atlantic University

Homotopy Types of Random Cubical Complexes

Driscoll, Keith Clayton State University

On Directed Labelings of Paths, Alternating Paths, and Cycles

Driskell, Kelly University of Tampa

On the number of components of coherent partitions

Engbers, John Marquette University

Extremal colorings and independent sets in k-chromatic graphs

Fehribach, Joseph D. WPI

Matroids and Their Kirchho Graphs

Ferrero, Daniela Texas State University, San Marcos

Bootstrap Percolation on Cubic Graphs

Flagg, Mary University of St. Thomas

Restricted power domination and zero forcing

Freyberg, Bryan University of Minnesota Duluth

March madness Magic: Scheduling a 64-Team Tournament With a Magic Cube

Froncek, Dalibor University of Minnesota Duluth

r-supermagic Labeling of Cartesian Products of Two Cycles

Geneson, Jesse Iowa State University

Graph and sequence Turan problems

Gil, Juan Penn State Altoona 

Schroder coloring and applications

Gilroy, Haile McNeese State University 

A Class of Bicyclic Antiautomorphisms of Mendelsohn Triple Systems

Gismondi, Stephen University of Guelph

Modifications to the Birkhoff Polytope and Complexity Class Boundaries

Gould, Ronald Emory University

Spanning bipartite graphs with high degree sum 

Gray, Aaron D.

Northeast State Community College

Critical Graphs in Peg Solitaire

Gupta, S. Northville High School

Conditional fractional matching preclusion of pancake graphs 

Guyer, Michael Auburn University

On Clique Immersions in Line Graphs

Hammer, James

Cedar Crest College

A Regional Kronecker Product and Multiple-Pair Latin Squares

Harborth, Heiko TU Braunschweig, Germany

Minimum Saturated Packings of Integral Triangles

Hayat, Sakander

GIK Institute of Engineering Sciences and Technology

Co-edge-regular graphs which are cospectral with the s-extension of the square grid graphs

Heissen, Mia Manhattanville College

On the Erdos-Sos conjecture for graphs with diameter at most k+2

Helbling, Caleb  

Directed Graph Hashing

Hell, Pavol Simon Fraser University, Burnaby

Graph Homomorphism Dichotomies

Hell, Pavol  Simon Fraser University

Graphs with Loops

Hernandez-Cruz, Cesar Facultad de Ciencias, UNAM

Panchromatic patterns by paths

Hersh, Partricia The University of Oregon

On counting by inclusion-exclusion: Moebius functions, shellability and discrete Morse theory

Hersh, Partricia The University of Oregon

Posets arising as 1-skeleta of simple polytopes, the nonrevisiting path conjecture, and poset topology

Kingan, Sandra Brooklyn College, CUNY

Generating graphs with a specific minor

Hogben, Leslie Iowa State Univeristy

Maximum eigenvalue multiplicity and zero forcing on a graph

Holliday, Sarah Kennesaw State University

Distinct Representatives in Special Set Families in Graphs

Hopkins, Brian Saint Peter's University

Restricted Multicompositions

Huerta, Zazil Santizo Michigan Technological University

The Hamilton-Waterloo Problem with C6 and C3x factors

Jacob, Bonnie Rochester Institute of Technology

For which graphs does swapping vertices at distance two with distance one produce a well-defined graph?

Jacob, Jobby Rochester Institute of Technology

Rank numbers of the complements of some graphs

Jedlickova, Nikola Charles University, Prague, Czech Republic

Complexity of recognizing cover-incomparability graphs

Jeffries, Joel Iowa State University

The x-fold spectra of Stanton 4-cycles

Johnson, Peter Auburn University

Weighting the Edges of a Connected Graph to Achieve Metric Dimension One

Johnston, Daniel Skidmore College

On Rainbow Turan Numbers

Kaneko, Yoshihiro Gifu University

Stable spanning sink trajectory of in-trees on grid graph

Kenepp, David Penn State University, Altoona

Central binomial coefficients and pattern-avoiding permutations

Khera, Jessica Florida Atlantic University

Longest Path in Acyclic Orientation of Complete Bipartite Graph 

Kimura, Kenji Ishinomaki Senshu University

Regular graph and some vertex-deleted subgraph

Kritschgau, Jurgen Iowa State University

Few H copies in F-saturated graphs

Lee, S. University of Mississippi

On graphs with a small circuit spectrum

Lefmann, Hanno TU Chemnitz, Germany

Edge-colorings of hypergraphs avoiding a rainbow expanded complete graph or a Fan hypergraph

Li, Jonathan Texas Academy of Math and Science, UNT

A performance study of the greedy algorithm for dominating set

Lorch, John Ball State University

Sudoku-Pair Latin Squares Based on Groups

Lorenzen, Kate Iowa State University

Computing Kemeny’s Constant for barbell-type graphs

Low, Richard San Jose state University

N- and P-positions in Harary's 'Caterpillar Game'

Lundberg, Erik Florida Atlantic University

Asymptotic enumeration of lonesum matrices

Masuda, Ariane NYC College of Technology

Redei permutations with cycles of length 1 and k

Mayer, Carolyn Worcester Polytechnic Institute

Graphs for Low-Power Cooling Codes

McGinn, Donald University of Nevada, Las Vegas

Face-Magic Graphs

Merz, Sarah University of the Pacific

Regular Tournaments with Minimum Split Domination Number

Messinger, M. E. Mount Allison University,

Reconguration for Dominating Sets

Meyerowitz, Aaron Florida Atlantic University

Two Player Number Theoretic Game

Mukthineni, Turun Colorado State University

Classifying Spacial Triangulations under Symmetry

Murphy, Kyle  

Flexibility of Planar Graphs with lists of size 4

Myers, Timothy Howard University

Constructing and Applying Clifford Graph Algebras for Dutch Windmill Graphs

Narrayan, Darren Rochester Institute of Technology

Two Approaches for Breaking Graph Symmetry

Neal, MeiRose Stonehill College

DNA Self-Assembly: Complete Tripartite Graphs

Noble, Matt Troy University

A Few Questions on Color-Critical Subgraphs 

O, Suil The State University of New York, Korea

Ore-type Conditions for the Existence of Even [a; b]-factor in Graphs

Olejniczak, Drake Purdue University Fort Wayne 

On Graphs with Singleton Uniform Spectrum

Olsen, Trevor University of South Carolina

Minimum Wiener Index in Triangulations and Quadrangulations 

Osaye, Fadekemi Janet Auburn University

On Weighted Eccentric Connectivity Index of a Graph

Owens, Caitlin  DeSales University

The Very Strong Proper Connection Number and Shortest Path Colorings

Pardalos, Panos University of Florida

Inverse Combinatorial Optimization Problems

Parida, Prangya  Michigan Technological University

On the existence of uniform 3-class regular partial Steiner triple systems

Paskowitz, Lyle Johns Hopkins University

Efficient and Non-efficient Domination of Z-stacked Archimedean Lattices

Peart, Paul Howard University

Finding Exact Values of a Character Sum

Pfaltz, John L. University of Virginia

The Amazing Combinatorics of Perfect Cycle Systems

Prier, David Gannon University

The Inverse Domination Number Problem is Still Open

Reid, Michael University of Central Florida

Rectangles Tiled by Small Polyominoes

Reinhart, Carolyn Iowa State University

Product throttling for the game of Cops and Robbers

Reiswig, Josiah  Anderson University

Aphid Sequences: Turning Fibonacci Numbers Inside Out

Rombach, Puck UVM

Lower bounds for rainbow Turan numbers of paths and other trees

Rubio, Ivelisse University of Puerto Rico, Rio Piedras

The covering method for p-divisibility of exponential sums over any finite field

Ryan, Kathleen DeSales University

Maximum Proper Diameter in 2-connected Graphs

Salehi, Ebrahim University of Nevada, Las Vegas

On Rainbow Mean Colorings of Graphs

Santiago, Javier University of Puerto Rico

On permutation binomials of index qe-1 + qe-2 = ...+1

Schmidt, Kai-Uwe Paderborn University

Highly nonlinear functions

Schmitt, Karl R. B. College of Engineering

Fortnite Chest Collection Optimization: A Twist on the Orienteering Problem

Seda, Carlos University of Puerto Rico, Rio Piedras

Solvability of systems of polynomial equations with multivariate polynomials as coefficients

Servatius, Brigitte WPI

Equitable partitions and Kirchhoff graphs

Servatius, Herman  WPI

Stressability of multidimensional frameworks

Shahrokhi, Farhad University of North Texas

Bounding the trace function of a hypergraph

Skyers, Marina Penn State, Brandywine

Rearrangements of the Simple Random Walk on (0,1)

Soifer, Alexander University of Colorado at Colorado Springs

From Rolf Nevanlinna to Abacus, A Noteworthy History of an IMU Prize’s Name

Sprangel, Elizabeth Iowa State University

Anti-van der Waerden numbers on trees

Su, Hsin-hao Stonehill College

On Subdivision Graphs which are 2-steps Hyperhamiltonian Graphs and Hereditary Non-2-steps Hamiltonian Graphs

Sun, Carl Xiaohang Sacramento Waldorf School

On Euclidean Deficiency of Zykov sums of caterpillars and one vertex null graph

 Tian, D. Northville High School

Extraconnectivities of arrangement graphs

Tiemeyer, Michael Georgia Southern University

On 4-cycle factorizations with two associate classes where a is 9-the final time

 Torres, Jaziel

 University of Puerto Rico at Rio Piedras

Analysis and Computation of the Multidimensional Linear Complexity of Periodic Arrays

Tranel, Theodore Iowa State University

Characteristics of Partial Geometric Designs arising from Partial Geometries

Trenk, Ann Wellesley College

The Distinguishing Number of a Poset

Wass, Isaac Iowa State University

New Planar, Tree, and Density Results Involving Pansophy

Williamson, Matthew Marietta College

On Computational Complexity of the Simple Path-Dependent Shortest Path Problem

Yatauro, Michael Penn State, Brandywine

Degree Sequence Theorems for Measures of Connectivity

Zhang, Meng University of North Georgia

A Conjecture of Chemical Indices

Zhao, Qinghong  University of Mississippi

Gallai-Ramsey numbers for some graphs with chromatic number three

Return to Top

50th SEICCGTC Abstracts

Abdallah, Mohamad American University of Kuwait

 Conditional Strong Matching Preclusion of the Alternating Group Graph

Adachi, Tomoko Toho University

Secret Sharing Scheme Using Magic Cube and Latin Squares

Adeniran, Ayomikun  

 Numerical Semigroups

Ahmad, Sarfraz COMSATS University Islamabad, Pakistan

Topological Descriptor of 2-Dimensional Silicon Carbons and Their Applications

Ahmad, Uzma  University of the Punjab, Pakistan

 On Mixed Metric Generators of Graphs

Aiken, Sophie

Colorado College

Hall t-chromatic spectra and weak Hall t-chromatic spectra of the Petersen Graph and wheels with odd numbers of spokes 

Ali, Kashif

COMSATS University Islamabad, Pakistan.

M-Polynomials and Topological Indices Related to Graph Operations

Alm, Jeremy Lamar University                                            

A Sumset Problem in Abelian Groups

Al-ogaidi, Awss University of Sussez

Large Arcs in Small Planes

Anderson, Mark Rollins College

Are Complete Graphs the Only x -Robust-Critical Graphs?

Angeleska, Angela University of Tampa

Modular Decompositions and Coherent Network Partitions

Arunandhi, P. International Academy

Steiner k-diameter of Tensor Product of Complete Graphs

Asplund, John Dalton State College

Optimizing Geometric Requirements for Redistricting

Aydin, Nuh Kenyon College

New Results on Equivalence of Cyclic Codes and a Generalization of a Search Algorithm

Babai, Laszlo University of Chicago

 

Global Symmetry from Local Information: The Graph Isomorphism Problem

 

Bailey, Sean University of Southern Maine

More Combinatorially Orthogonal Graphs

Balasubramanian, Suman DePauw University

Some Graph Labelings

Balof, Barry Whitman College

Bingo Paradoxes 

Barkley, Grant North Carolina State University

Perfect Matchings, Channels, and 2-Divisibility

Barrett, Wayne Brigham Young University

Spanning 2-Forests and Resistance Distance in 2-Connected Graphs

Barrus, Michael University of Rhode Island

Connectivity in realization graphs

Baskoro, Edy Tri Institut Teknologi Bandung, Indonesia.

Ramsey number for a tree versus a small wheel

Bataineh, Mohammad University of Sharjah, UAE

The Edge metric dimension of multiple wheel graphs

Baumbaugh, Travis Clemson University

Results on Recursive Generation of de Bruijn Sequences

Beasley, LeRoy Utah State University

(0, 1)-Matrices and Discrepancy

Beineke, Lowell Purdue University Fort Wayne

A Survey of Strongly Multiplicative Graphs and Related Labelings

Benakli, Nadia New York City College of Technology, CUNY

k-Neighborhood Degrees of a Graph

Berliner, Adam St. Olaf College

Matrix patterns and the inertia S n

Betten, Anton Colorado State University

New Families of Cubic Surfaces in Characteristic Two

Bickle, Allan Penn State Altoona

Independence Number of Maximal Planar Graphs

Bjorkman, Beth Iowa State University

k-foldability of words

Blanco, Saul Indiana University Bloomington

A Categorical Approach to Additive Combinatorics

Blumenthal, Adam Iowa State University

Sharp Bounds for Decomposing Graphs into Edges and Triangles

Boats, Jeffery University of Detroit, Mercy

The Pansophy of Multipartite Graphs

Bobga, Benkam University of North Georgia

List Colorings: Some Refinements of Hall’s Condition

Bok, Jan Charles University, Prague, Czech Republic 

Extremal problems for weighted Szeged index 

Brandstadt, Andreas University of Rostock, Germany

On Efficient Domination for some classes of H-free bipartite graphs

Bray, Amie Colorado State University

The Volume Bound for Nested Torus Links

Brewer, Alejandra Florida Southern College

The Asymmetric Index of a Graph and Families of Asymmetric Graphs 

Breen, Jane Iowa State University

Minimising the largest mean first passage time of a Markov chain and the influence of directed graphs

Brimkov, Boris Rice University

Injective choosability of subcubic planar graphs with girth 6

Brown, David Utah State University

Perfect Tournament Digraphs

Budzisz, Stephanie Oakland University

At-least-m-different predicate 

Buehrle, Charles Notre Dame of Maryland University 

Cycles in the burnt pancake graph

Burcroff, Amanda University of Michigan

The Upper Transversal Number of Uniform Hypergraphs

Burns, Jonathan Ionic Security

Remarks on Set Membership Filter Efficiency 

Bushaw, Neal Virginia Commonwealth University

The Even Cycle Spectrum

Cameron, Alex Vanderbilt University

The Saturation Number of Pineapples

Carlson, Josh Iowa State University

Throttling for the Game of Cops and Robbers

Carrigan, Braxton Southern Connecticut State University

Decomposing Set Intersection Graphs into Triples

Case, Benjamin Clemson University

Beta-Packing Sets in Graphs

Chan, W. H. The Education University of Hong Kong

Bulgarian Nim

Che, Zhongyuan Penn State University

An upper bound on Wiener Indices of maximal planar graphs

Colbourn, Charles Arizona State University

Popularity and Steiner Triple Systems

Chisaki, Shoko Tokyo University of Science

Deopout designs of deep learning

Chowdhury, Sajeeb Roy Colorado State University

Machine Learning for Better Combinatorial Algorithms

Cohen, Marshall Morgan State University

Roots of Formal Power Series and New Theorems on Riordan Groups

Collins, Karen Wesleyan University

Finding Balance in Ferrers Diagrams of Degree Sequences of Split Graphs

Cortez, Joseph Auburn University

The Intersection Problem for Maximum Packings of Kn with 4-Cycles

Couch PJ Lamar University

On NFL Scheduling and Thursday Night Football 

Cream Megan Dedar Crest College

Extensions of Pancyclicity

Culver, Eric University of Colorado, Denver

Finding Rainbow Triangles with Flag Algebra

Curran, Stephen University of Pittsburgh at Johnstown

C4 -face-magic torus labelings on C2m  X C2n

Curtis, Bryan University of Wyoming 

The Strong Orthogonal Property 

D'Andrea, Joy University of South Florida

An Extension of Euler’s Polyhedron Formula

Davenport, Dennis Howard University

3-Zebra Trees

Davis, Killian Clemson University

Convergences of Newton’s Method for Quadratics

De Jesus, Jose F. University of Puerto Rico

Graphs with the Same Truncated Graphic Matroid 

Deaett, Louiss  Quinnipiac University

Efficient (or less inefficient) computation of the zero forcing number

DeDeo, Michelle University of North Florida

The Energy of Ramanujan Graphs

Defant, Colin Princeton University

Stack-Sorting, Set Partitions, and Lassalle's Sequence

Dorough, Stephanie Auburn University

Rainbow Connectivity and Proper Rainbow Connectivity

Draper, Richard Center for Computing Sciences/IDA 

Swapped Dragonfly

Driscoll, Keith Clayton State University

A Vizing-type result for semi-total domination

Dymacek, Wayne Washington and Lee University

Claw-free Steinhaus Complements 

Earl, Jonathan University of Wyoming

Minimum Number of Distinct Eigenvalues for Trees

Ekim, Tinaz Bogazici University

Advances on Equimatchable Graphs

Ellingham, Mark Vanderbilt University

Quadrangular embeddings of complete graphs

Elliott, Bradley Emory University

Increasing Paths in Countable Hypergraphs

Ellis, Brandi University of West Georgia

Signed magic rectangles with two filled cells in each column: Part 2

Ellis-Monaghan, Jo Saint Michael's College

Origami Knotting in Graphs

Emany-K, M.R. University of Puerto Rico, Rio Piedras, PR

The 5-cube Cut Number Problem: A Short Proof for a Basic Lemma

Epstein, Michael

Florida Atlantic University

On the Covering Number of U3(q)
Erickson, Lindsay

Augustana University

Edge-Nim on the K2,n
Factor, Kim Marquette University

 Split Domination Results for Tournaments with Connected Domination Graphs 

Fan, Jinping University of Tsukuba

Signature codes for weighted binary adder channel and multimedia fingerprinting

Farrelly, Colleen M. Quantopo, LLC

Quantum Persistent K-Cores for Community Detection and Ranking

Feder, Elie Kingsborough Community College-CUNY

Maximum Rectilinear Crossing Numbers of Polyhex Graphs

Fehribach, Joseph WPI

Uniformity in Kirchoff Graphs

Ferrara, Michael University of Colorado, Denver

Ore and Chvatal-type Degree Conditions for Bootstrap Percolation from Small Sets

Ferrero, Daniela Texas State University

Zero forcing in iterated line digraphs

Finbow, Art Saint Mary's University

On the Structure of 4-Regular Planar Well-Covered Graphs

Flagg, Mary University of St. Thomas

Rigid Linkage Forcing

Flesch, Breeann Western Oregon University

Approval Gap of Weighted k-Majority Tournaments

Freyberg, Bryan University of Minnesota Duluth 

On constant sum partitions and applications to distance magic-type graphs 

Froncek, Dalibor University of Minnesota, Duluth

How close to being platonic can you get?

Ganguly, Soumendra  Clemson University

Graph-Theoretic Parameters Related to Partial Domination 

Geneson, Jasse Iowa State University

Throttling for the Cop versus Robber Game

Gershkoff, Zachary Louisiana State University

Characterization and Enumeration of 3-Regular Permutation Graphs

Glasser, Abraham Rochester Institute of Technology

Failed Power Domination on Knodel Graphs

Golden, Shannon Colorado State University

Algebraically Dened Graphs and Their Girth

Golumbic, Martin University of Haifa, Israel

A Perfect Graph Jubilee

Gould, Ronald Emory University

On the Saturation Spectrum of Graphs

Graber, Nathan University of Colorado, Denver

Saturation for Berge Hypergraphs

Graham, Fan Chung University of California, San Diego

Regularity lemmas for clustering graphs

Graham, Ronald University of California, San Diego

Bubblesort, Juggling Sequences and Permutation Statistics

Grant, Jennifer Berkeley University

Aggregate Sequences in Sage

Gray, Daniel Florida Atlantic University

Split-S-Nim

Grimaldi, Ralph Rose-Hulman Institute of Technology

Ternary Strings and the Pell Numbers

Haithcock, Evan Clemson University

Convergences of Newton’s Method for Quadratics

Hall, Tracy New Vistas, LLC

A skeptical perspective on the 2n Conjecture

Hallas, Jamie Western Michigan University

Set-Defined Graph Coloring

Hammer, James Cedar Crest College

Sudoku Pair Latin Squares

Harborth, Heiko TU Braunschweig, Germany

Grid Domination on Hexagon Boards

Hartnell, Bert

Saint Mary's University

On graphs in which every maximal induced matching is of the same size 

Heath, Emily

University of Illinois

An improved upper bound for the (5,5)-coloring number of Kn

Heinig, Monika

Stevens Institute of Technology/Clyde

Limitations on the Simultaneous Maximization of Two Vulnerability Parameters

Hell, Pavol

Simon Fraser University

Bipartite analogues of comparability and co-comparability graphs

Hernandez-Cruz, Cesar

National Polytechnic Institute

Partitioning a cograph into forests and stable sets

Hilton, Anthony University of Reading

The Pseudograph and Simple Graph Threshold Number for Bounded Factorizations

Hogben, Lislie Iowa State University

Extending maximum nullity and zero forcing from graphs to hypergraphs

Holliday, Sarah Kennesaw State University

Distinct Representatives in Special Set Families in Graphs

Hopkins, Brian Saint Peter's University

Eriksson's Bulgarian Solitaire Variant

Hunter, Hayden University of South Florida

Subgraph Removal of 4-Regular Graphs and Changes in Genus Range

Hurlbert, Glenn Virginia Commonwealth University

Pebbling in Chordal Graphs

Imran, Muhammad United Arab Emirates University

On Partition Dimension of Infinite Graphs

Isaak, Garth Lehigh University

Interval Orders with Length Bounds

Ivy, Samuel  United States Military Academy

 Classifying the Fine Structures of Involutions Acting on Root Systems

Janwa, Heeralal University of Puerto Rico, Cayey Campus, PR

Transversal Intersection for further results on the conjecture of exceptional APN functions

Jedlickova, Nikola Charles University, Prague, Czech Republic

Wiener index on unicyclic graphs

Jeffries, Joel Iowa State University

A Combinatorial Game On Graphs

Jialong-Sun Sacramento Waldorf School

Mongolian Tents admitted HLS and VHLS labelings

Johnson, Peter Auburn University

A Mixed Hypergraph Coloring Problem

Johnston, Daniel Grand Valley State University

Deranged Matchings

Joveski, Zlatko Vanderbilt University

On a graph class generalizing interval and permutation graphs

Kaso, Niko Oakland University

At-least-m-different predicate 

Kemnitz, Arnfried                                                             University of Braunschweig, Germany

On the Chromatic Edge Stability Number of Graphs                       

Kenyon, Catherine Clemson University

Convergences of Newton’s Method for Quadratics

Keranen, Melissa Michigan Technological University

TS(v;) with cyclic 2-intersecting Gray codes: v 0 or 4 (mod 12)

Khodkar, Abdollah University of West Georgia

Signed magic rectangles with two filled cells in each column: Part 1

Kikas, Lazaros University of Detroit Mercy

Effect of a Superuser on the Pansophy of a Network

Kleinberg, Jon Cornell University

Graph-Theoretic Models of Behavioral Phenomena

Kreher, Donald Michigan Technological University

Sequenceable partial Steiner triple systems

Kritschgau, Jurgen  

Rainbow matchings of size m in graphs with total color degree at least 2 mn

Krop, Elliot Clayton State University

Upper bounds for inverse domination in graphs

Lane-Harvard, Liz University of Central Oklahoma

Strongly Regular Graphs From Large Arcs in Affine Planes

Larson, Craig Virginia Commonwealth University;

The Graph Brain Project

Laskar, Renu C. Clemson University

The 2-dimension of a Tree

Lauter, Kristin Microsoft Research

Supersingular Isogeny Graphs in Cryptography

Leach, David University of West Georgia

Magic Rectangles with Empty Cells

Lee, Jon University of Michigan

Volumes of sparse Boolean quadric relaxations

Lefmann, Hanno TU Chemnitz, Germany

Edge-colorings of hypergraphs avoiding a rainbow expanded complete graph

Leshock, Lorinda University of Delaware

Pappus Configurations in Finite Planes

Lesniak, Linda Western Michigan University

Hamiltonian properties in k-partite graphs

Levit, Vadim, E. Ariel University

W2 -graphs and shedding vertices

Li, Zhongshan (Jason) Georgia State University

Diagonalizable matrices and cycle structures of their digraphs

Lipman, Drew Hypergiant - Space Age Solutions

Reconstruction of Graphs from Dominating Sets

Lockard, Shannon Bridgewater State University

Hyper m−ary Partition Sequences 

Lopez, Oscar Florida Atlantic University

New Recursive techniques to construct combinatorial designs from smaller simple designs

Lorch, John Ball State University

Mutually Orthogonal Factor-Pair Latin Squares

Low, Richard San Jose State University

On the Integer-antimagic Spectra of Hamiltonian Graphs

Lorenzen, Kate Iowa State University

Constructions of distance Laplacian cospectral graphs

Lu, Linyuan University of South Carolina

The maximum p-Spectral Radius of Hypergraphs with m Edges

Lutrell, Kristi Seton Hall University

The Maximization of Neighbor-Component Order Connectivity

Marr, Alison Southwestern University

Zagreb Indices on Directed Graphs

Martin, Sydney Stonehill College

Minimal Tile and Bond-Edge Types for Self-Assembling DNA Graphs of Triangular Tiles

Martinez,-Rivera, Xavier Auburn University

The almost-principal minors and ap-rank of symmetric matrices

Mauro, Samantha Stonehill College

Minimal Tile and Bond-Edge Types for Self-Assembling DNA Graphs of Triangular Tiles

McConnell, Ross Colorado State University

Min Orderings and the Complements of Threshold Tolerance Graphs

McGinnis, Daniel New College of Florida,

Extremal Problems Related to the Cardinaltiy Redundance of Graphs 

Melekian, Chris Oakland University

Fractional Matching Preclusion for (Burnt) Pancake Graphs

Merz, Sarah University of the Pacific

A tight lower bound for the split domination number of a regular tournament

Meyer, Seth St. Norbert College

Vertex degree sequences mod k

Aaron Meyerowitz Florida Atlantic University

Generalized Derangements

Meyers, Timothy Howard University

An Ordered Tuple Construction of Classical Geometric (Clifford) Algebras and Geometric Algebras with Signature

Micek, Piotr Jagiellonian University

Weak coloring numbers of planar graphs

Milans, Kevin West Virginia University

Forbidden induced subgraphs and Gallai vertices

Miller, Jordan Washington State University,

Intersections, circuits, and colorability of line segments

Molina, Robert Alma College

Reconstruction Numbers for Unicyclic Graphs

Mukthineni, Tarun Colorado State University

Classifying Spacial Triangulations under Symmetry

Munaro, Andrea West Virginia University

Semitotal Domination: New hardness results and a polynomial-time algorithm

for graphs of bounded mim-width

Narayan, Darren Rochester Institute of Technology

The Asymmetric Index of a Graph and Balanced Incomplete Block Designs 

Nastas, Evangelos Florida Atlantic University

Circular Representations of Simple Connected Graphs & Delta Graph Minimum Semidefinite Rank

Nemani, Serita Georgian Court University

Anti-magic Labeling of Cartoon Flowers

Newman, N. A. Troy University

About Colorings of (3,3)-Uniform Complete Circular Mixed Hypergraphs

Noble, Matt Middle Georgia State University

The Unit-Distance Crossing Number of a Graph

O Cathain, Padraig Worcester Polytechnic Institute

Morphisms of complex Hadamard matrices

Olejniczak, Drake Western Michigan University

Variations in Ramsey Theory

Ou, Tingting Johns Hopkins University

Expected Survival Time of a Probabilistic Counting-Out Game on a Line

Owens, Andrew Auburn University

JL-colorings on general graphs 

Pinciu, Val Southern Connecticut State University

Genus, Skewness, Thickness and Coloring Theorems

Qiu, Jiangyi University of Minnesota, Duluth

2-nearly Platonic graphs

Qiu, Ke Brock University

Finding One-to-Many Disjoint Shortest Paths in Hypercubes

Qualls, Brittian McNeese State University

A Note on Bicyclic Antiautomorphisms of Mendelsohn Triple Systems

Raza, Zahid University of Sharjah, UAE 

LCEM and Reciprocal LCEM Matrices

Rehm, Hunter University of Vermont

Anit-van der Waerden Numbers on Graph Products 

Reid, Brooks California State University, San Marcos

Origins of the Southeastern International Conferences on Combinatorics, Graph Theory and Computing 

Reid, Michael University of Central Florida

Some recent developments in tiling with polyominoes

Reinhart, Carolyn Iowa State University

The normalized distance Laplacian Matrix

Reiswig, Josiah University of South Carolina

On the k-Steiner radius and k-Steiner Diameter of a graph with 4<k<5

Remshagen, Anja University of West Georgia

Counting Magic Venn Diagrams

Robinette, Michelle University of Nevada, Las Vegas

On the Likelihood of Symmetrical Cayley Maps for Certain Abelian Groups 

Rombach, Puck University of Vermont

Role coloring graphs in hereditary classes

Ross, Michael Iowa State University

PSD-Throttling on Trees

Rubalcaba, Roberto San Diego City College

Aggregate Sequences

Ruskey, Frank University of Victoria

Solution of an Infinite Nested Recurrence Relation 

Saccoman, John T. Seton Hall University 

Integral Regular Split Multigraphs

Salehi, Ebrahim University of Nevada Las Vegas

On Cordial set of Q 7

Schiermeyer, Ingo Technische Universitat Bergakademie Freiberg, Germany 

Gallai Ramsey numbers of complete graphs and odd cycles 

Schmitt, John R. 

Middlebury College

Distinct Partial Sums in Cyclic Groups
Schulte, Alex Iowa State University

Edge Saturation for complete graphs

Schwartz, Andrew Southeast Missouri State University

Zero Forcing Sets in H-matchable graphs

Servatius, Brigette  Worcester Polytechnic Institute

 Delta-matroids from matroids

Servatius, Herman Worcester Polytechnic Institute

Delta-matroids from matroids

Shahrokhi, Farhad  University of North Texas 

New Results on Location Domination and Identifying Codes

Shu, Michelle Johns Hopkins University

Survival Probabilities of a Probabilistic Counting-Out Game on a Line 

Singgih, Inne University of South Carolina 

Subtractive Magic and Antimagic Total Labeling for Basic Families of Graphs

Sinko, Ann College of St. Benedict and St. John's University

Game Proper Chromatic Numbers

Skyers, marina Penn State, Brandywine

A Closer Look at the Fine Structure of the Random Walk on (0, 1)

Soifer, Alexander University of Colorado at Colorado Springs

Chromatic Number of the Plane: Breakthroughs and Further Aspirations

Stern, Michal Academic College of Tel-Aviv Yaffo

Vertices Deletions in Clustered Spanning Tree

Stinson, Douglas University of Waterloo

Block-avoiding sequencings of points in Steiner triple systems

Su, Hsin-Hao Stonehill College

On Friendly Index Sets of Barycentric Subdivision of Wheels 

Syrotiuk, Violet Arizona State University

Requirements on Locating Arrays in Practical Experimentation

Szwarcfiter, Jayme Federal Univ of Rio de Janeiro 

On Interval Graphs Represented by Two Interval Sizes

Tiemeyer, Michael Georgia Southern University

On z-cycle factorizations with two associate classes

Todt, Heiko Stonehill College

Minimal Tile and Bond-Edge Types for Self-Assembling DNA Graphs of Triangular Tiles

Trenk, Ann Wesleyan University

Balanced and Unbalanced Split Graphs

Trotter, William Georgia Institute of Technology

Dimension and Height for Posets with Planar Cover Graphs

Tsunoda, Yu Chiba University

Probabilistic Upper Bound on the Domination Number

van der Holst Georgia State University

Progress on a characterization of signed graphs (G, E) with v(G, E) < 3

Vandell, Chip Purdue University Fort Wayne 

The Maximum Decycling Number of a Graph

Wang, Zhiyu  University of South Carolina 

Color-disjoint rainbow spanning trees of edge-colored graphs

Wass, Isaac Iowa State University

The Graceful Tree Conjecture and Functions with an Attractive Fixed Point

Weiner, Michael Penn State Altoona

On pattern-avoiding Fishburn permutations

West, Douglas Zhejiang Normal University and University of Illinois

Cut-edges and Regular Subgraphs in Odd-degree Regular Graphs

Wierman, John Johns Hopkins University

Site percolation threshold bounds for the 4,82) Archimedean tiling 

Williams, Trevor Florida Atlantic University

Graph Nim

Wu, Sylvia Clemson University

Convergences of Newton’s Method for Quadratics

Wu, T. Northville High School

Steiner (n-k)-diameter of some interconnection networks

Xie, Xiao Johns Hopkins University

Pure and Mixed Multi-Step Strategies for Rendezvous Search on the Platonic Solids 

Xu, Rupei The University of Texas at Dallas

Ulam Decompositions in Sparse Graphs

Yatauro, Michael Penn State-Brandywine

Stability Theorems and Degree Sequence Theorems in Graph Theory

Young, Derek Iowa State University

Determining the maximum nullity and minimum rank field independence for some graphs

Zhang, Fuzhen Nova Southeastern University

Enumerating extreme points of the polytopes of stochastic tensors: an optimization approach

     

Return to Top

49th SEICCGTC Abstracts

Abdallah, Mohamad

American University of Kuwait

Panconnectivity of 2-Tree Generated Network
Allred, Sarah

Louisiana State University

Theta Graphs are Hall t-chromatic
Alqahtani, Mohra 

Western Michigan University

A Generalization of Line Graphs 
Alsardary, Salar

University of Sciences, Philadelphia

Triangle Neighborhood Graphs
Anantapantula, S. 

 Northville High School

Matching Preclusion of Shuffle Cubes 
Anderson, Mark

Rollins College

Robust Graph Colorings
Bachstein, Anna

Clemson University

Domination Parameters of Rooks and Bishops
Baumbaugh, Travis

Clemson University

Batch Codes from Reed-Muller Codes
Barnes, Matthew

Louisiana State University

Immersion Intertwines of Infinite Graphs
Beasley, LeRoy 

Utah State University 

Linear Operators on Graphs: Genus Preservers 
Barrus, Michael

University of Rhode Island

Towards spectral characterizations of hereditary graph classes
Beagley, Jonathan

Valparaiso University

Combinatorial Problems in GPGPU
Belkouche, Wiam

Hassan II University

Extremal results on tournaments and 4-uniform hypergraphs
Benferhat, S

CRIL-CNRS, Artois University, France 

Adjustment-based conditioning in OCF graphical models 
Bereg, Sergey

University of Texas at Dallas

Permutation Arrays and a New Block Design
Bhutani, Kiran

The Catholic University of America

On F-Domination in Graphs
Bickle, Allan

Penn State-Atloona

Collapsible Graphs
Bosse, Christian

University of Central Florida

Gallai-Ramsey numbers of C9 and C11 with multiple colors
Brandt, Axel

Davidson College

Additive Coloring of Cycles
Braun, Jeff

Johns Hopkins University

Symmetric Rendezvous on the Unit Cube
Brewer, Alejandra

Florida Southern College

The Decomposition of KD+V Into K4-E: A Particular Case
Briggs, Joseph

Carnegie-Mellon University 

Extremal Collections of k-Uniform Vectors 
Brown, David

Utah State University

Renyi α-Entropy of Tournaments
Bushaw, Neal

Virginia Commonwealth University

Automated Conjecturing and Collaborative Mathematics 
Byers, Alexis

Western Michigan University 

On k-Rainbow Colorings of Graphs 
Cahan, Owen  

The Unicyclic Random Graph Process Abstract

Carballosa, Walter Florida International Univeristy

Distinguishing wheel graphs by the alliance polynomial

Carr, Edward North Carolina A&T State University

Hamiltonian Cycles in St(CnXCm)

Carrigan, Braxton Southern Connecticut State University

Traveling in a Blinking Node System

Chaichana, Khuanchanok  Chiang Mai University 

Suborbital Graphs of the Congruence Subgroup I0(N) 

Choi, Jang Hun 

 Hofstra University The Hadwiger-Nelson Problem with Two Forbidden Distances 
Choi, Sul-young Le Moyne College

Error correcting codes from subspaces of edge spaces II

Chopra, Dharam Wichita State University

Some New Necessary Conditions for the Existence of Balanced Arrays with Applications

Cooper, Alana University of Tennessee

Decompositions of Complete Multigraphs into Small Tripartite Multigraphs

Couch, PJ  Lamar University 

Avoiding Back-to-Backs 

Curran, Stephen University of Pittsburgh at Johnstown 

Amazing Arithmetic Properties of 12,345,679 

Darr, Laura  Stonehill College 

On the Edge-Balance Index Sets of Distance Two of Wheels

Dinitz, Jeff University of Vermont

The Construction and Uses of Heffter Arrays

Doucette, Alexis Stevens Institute of Technology 

Component Order Neighbor Connectivity: A Generalization of Domination Alteration Sets 

Driscoll, Keith  Clayton State University 

Some results related to the Kulli-Sigarkanti conjecture 

Dula, G   Nac Netanya, Isreal

Usage of shadow (local) geometry to find W(23; 16)

Ealy, Clifton Western Michigan University

On the Loop Cloud of a Group

El-Zanati, Saad Illinois State University

On Spanning m-regular Graph Designs

Ellingham, Mark Vanderbilt University

The Chvatal-Erdos condition for prism-hamiltonicity

Elliott, Bradley Emory University

Embedding Hypertrees into Steiner Triple Systems

Ellis-Monaghan, Joanna Saint Michael's College

New Dualities From Old: Maps, Ribbon Graphs, and Tualities

Epstein, Michael Florida Atlantic University

The Covering Numbers of Some Finite Simple Groups

Fallon, Joshua  Louisiana State University

On Maximum Rectilinear Crossing Number of Subdivided Stars 

Feder, Elie Kingsborough Community College-CUNY

Maximum Rectilinear Crossing Numbers for Polyiamond Graphs 

Fehribach, Joseph  WPI

Matrices and Kirchhoff Graphs, A Rank 2, Nullity 2 Construction 

Fenstermacher, Todd Clemson University

Perfect Domination on Knights

Flesch, Breeann  Western Oregon University

Veto Interval Graphs 

Froncek, Dalibor University of Minnesota, Duluth

You Can't Always Get What You Want. . .

Gil, Juan  Penn State, Altoona 

On rooted planar maps and Dyck paths 

Glorioso, Vincent Auburn University Edge-Regular Graphs with λ=2
Gopalakrishnan, K. East Carolina University

Semaphore based solutions to Group Mutual Exclusion Problem

Guest, Kelly University of Minnesota

Eccentric Embeddings of Labeled Graphs

Guo, Ricky Westview High School

On Gracefulness of Face Splitting Graphs of Cycles Related Graphs

Haghshenas, Sadegheh Illinois State University

Embedding Factorizations for 4-uniform Hypergraphs

Hammer, James Cedar Crest College

Odd Coverings of Subsets of the Integers

Harborth, Heiko TU Braunschweig, Germany

Parity Graphs for Convex Drawings

Hart, Ian Western Michigan University

Majestic t-Tone Colorings

Holliday, Sarah Kennesaw State University

Neighborhood Representatives

Holmes, Amber   Auburn University

Revisiting the Intersection Problem for Maximum Packings of K 6n+4 with Triples 

Isaak, Garth Lehigh University 

A Two Player Graph Pebbling Game 

Johns, Garry Saginaw Valley State University

Induced Colorings of Graphs

Johnson, Pete Auburn University

Proper dege-colorings which forbid rainbow cycles

Johnston, Daniel Grand Valley State University

Rainbow Turan Numbers for Paths and Forests of Stars

Jordan, Heather  Albion College

±Skolem-type Difference Sets

Jung, Ji-Hwan  Sungkyunkwan University 

Riordan graphs and their structural properties 

Kaneko, Yoshihiro Gifu University

Stable transmission trees for mobile sink in rectangular wireless sensor network

Kaso, Niko  Oakland University 

Facet inducing inequalities of multiple at-least 

Keller, Ariel Emory University

Zero Forcing Polynomial for Cycles and Singly-Chorded Cycles

Khodkar, Abdollah  University of West Georgia 

Magic squares with empty cells 

Khosravi, Maryam University of Kerman, Iran 

On Coloring Complete Binary Trees 

Kim, Hana  Sungkyunkwan University 

Pick two points in a tree 

Krop, Elliot Clayton State University

A Vizing-type result for semi-total domination

Kruk, Serge Oakland University 

On the automated discovery of facet inducing inequalities 

Lange, Thomas University of Applied Sciences Mittweida

An FPRAS for k-edge connected unreliability

Langley, Larry University of the Pacific

Minimal Dominating Separating Sets in f1g-Cycle Extendable Tournaments

Laskar, Renu Clemson University

Varieties of Matchings in Graphs

Lefman, Hanno TU Chemnitz, Germany

On a variation of Hindman's Finite Sums Theorem

Linderman, Bill King University

Ramsey Numbers for Trees with Large Maximum Degree

Lo, Sheng-Ping Bill Lo  

On Gracefulness of Vertice Splitting Extensions of Cycles

Loeb, Sarah College of William and Mary

Edge Saturation for complete graphs

Lorch, John Ball State University 

A Generalization of Franklin's Magic Squares 

Low, Richard  San Jose State University

On C4-face (1; 0; 0)-magic Polyominoes 

Lubiw, Anna University of Waterloo

On Beyond Tutte’s Graph Drawing Algorithm 

Lubiw, Anna University of Waterloo

Reconfiguration of Triangulations of a Planar Point Set

Marge, Thomas Johns Hopkins University

Efficient Domination on Archimedean Lattices

Matzke, Ryan University of Minnesota 

Finding the Maximum Size of (k; l)-sum-free Sets in Finite Cyclic Groups 

McGinn, Donald  University of West Florida

On the existence of partitioned incomplete Latin squares with five parts 

Melahouris, William  

On the Integer-Magic Spectra of Connected and Sliced Cycles 

Meyerowitz, Aaron

Florida Atlantic University

Generalized Derangements
Moazzez, Babak 

Kennesaw State University 

A Polyhedral Study of Dynamic Monopolies in Graphs
Molina, Robert  Alma College 

On the Reconstruction Number of a Unicyclic Graph

Moss, Gabrielle  

Percolation threshold bounds for the 2-uniform (3,4,3,12;3,122) lattice

Murphy, Kaitland Utah State University

On Fractional Realizations of Tournament Score Sequences

Muth, Alicia  Stevens Institute of Technology 

Component Order Neighbor Connectivity: A Generalization of Domination Alteration Sets 

Myers, Timothy Howard University 

An Elementary Construction of the Clifford Algebra Gn, and its Application to Star Graphs

Narayan, Darren Rochester Institute of Technology

Shortest Paths in Highly Symmetric Graphs

Noble, Matt Middle Georgia State University

0-Realizability and Assorted Musings on Inverse Domination

O'Connell, Kelly Vanderbilt University

Hamiltonicity of 3-connected, planar, K 1;1;5-minor-free graphs

Olejniczak, Drake Western Michigan University

Uniformly Connected Graphs

Owens, Andrew Auburn University

 Edge colorings of connected graphs with as many colors as possible which forbid rainbow cycles

Perry, Katherine University of Denver

Throttling for the Game of Cops and Robbers on Graphs

Petingi, Louis College of Staten Island (CUNY)

A Family of Graphs with Maximum Number of Spanning Trees and Most Reliable Graphs

Pfaltz, John  University of Virginia

Counting Graphs with the Sperner Property

Pinciu, Val Southern Connecticut State University

Guarding Polyforms

Pinero, Fernando University of Puerto Rico at Ponce

Basic Parameters of Schubert cell codes

Putnam, Bette Catherine Delta State University 

On the Bicycle Spectrum of Graphs 

Qiu, Ke Brock Uiversity 

On Forward Difference and Computing Surface Areas of Interconnect Networks

Qualls, Brittain McNeese State University

Some Bicyclic Antiautomorphisms of Mendelsohn Triple Systems

Raychaudhuri, Arundhati College of Staten Isand (CUNY)

Distance-k Labeling of Interval and Unit Interval Graphs

Reid, Michael University of Central Florida

Generating sets for Symmetric and Alternating groups

Rombach, Puck  

Guessing numbers of graphs

Saccoman, John T  Seton Hall University

Underlying Split Multigraphs

Salehi, Ebrahim   University of Las Vegas

On Cordial sets of Regular Bipartite Graphs 

Schiermeyer, Ingo Technische Universitat Bergakademie Freiberg 

Gallai Ramsey number for K4

Schwartz, Andrew Southeast Missouri State University 

Matchable Trees: Distance Distribution 

Sewell, Louis The MITRE Corporation

Vertex-Based Distinguishing Collections

Shahrokhi, Farhad University of North Texas 

Pseudo transitivity and intersection graphs

Shapiro, Louis Howard University

Ten open questions about the Riordan group

Siddiqui, O. University of Michigan 

Matching Preclusion of a Generalized Cartesian Product of Graphs 

Simsek, Yilmaz  Akdeniz University, Turkey 

Remarks on Families of Combinatorial Numbers Including Generating Functions and Their Applications  

Sinko, Anne College of St. Benedict and St. John's University

R-colorings

Soifer, Alexander University of Colorado at Colorado Springs

The International Mathematics Union, a servant or a ruler of the profession?
Rolf Nevanlinna Prize: How a mistake of ignorance is becoming a stain of intent.

Song, Zi-Xia University of Central Florida

Recent Results on Gallai-Ramsey Numbers of Cycles

Sprague, Alan Clemson University

Multithreshold Graphs

Srivastava, R. National Institute of Technology Sikkim, India

Construction of cospectral signed graphs

Stinson, Douglas

University of Waterloo

A Brief Retrospective Look at the Cayley-Purser Public-key Cryptosystem, 19 Years Later

Striker, Jessica

North Dakota State University Local Actions Create Global Change
Striker, Jessica North Dakota State University

Combinatorics of Square Ice Graphs

Su, Hsin-Hao Stonehill College

On Graceful Spectra of Graphs

Szwarcfiter, Jayme                       Federal University of Rio de Janeiro                 

On Edge Domination of Graphs

Tenpas, Nathan Davidson College

Improving Bounds on the Additive Choice Number for Sparse Graphs

Tesman, Barry Dickinson College

Optimal T-colorings of Directed Graphs

Thomas, Brent

Utah State University

Strong Tournaments That are not Cycle Extendable
Tiner, Gary Faulkner University

On the Loebl-Komlos-Sos Conjecture, lopsided trees, and certain caterpillars

Traetta, Tommaso Ryerson University

The golden jubilee of the Oberwolfach problem

Ullman, Daniel

George Washington University Differences of Bijections
Ullman, Daniel George Washington University

Gems from the Problem Section of the American Mathematical Monthly

Wehrung, Ben Jacksonville University

Quasigroups with a Hole of Size 4, 6, 8, or 10

Weiner, Michael  Penn State, Altoona 

Bounce statistics for rational lattice paths 

West, Elanor Johns Hopkins University

Rendezvous Search on the Edges of Platonic Solids

Yatauro, Michael Penn State-Brandywine

Binding Number and Wiener Index

Zahn, Mingquan Millersville University of Pennsylvania 

s-Hamiltonicity in Line Graphs 

Zamfirescu, Carol  Ghent University, Belgiom 

Cubic vertices in planar hypohamiltonian graphs 

Zhang, Jingmei University of Central Florida

Gallai-Ramsey numbers of C10 and paths of small order with multiple colors

Zhao, Cheng Indiana State University 

Clustering of hypergraphs using microRNA and mRNA expression data from TCGA

Zhao, Yunfan Johns Hopkins University 

Perfect Domination Ratios of Archimedean Lattices 

48th SEICCGTC ABSTRACTS

Abudayah, Mohammad The University of Jordan, Amman, Jordan

Square Complementary Stable Graphs

Adachi, Tomoko

Toho University

General construction of cluttered orderings and square disk arrays

Ahmad, Sarfraz

COMSATS Institute of Information Technology, Lahore- Pakistan

On some topological indices and polynomials of the Zigzag Boron triangular nanotube BNT[p, q]

Ahmad, Uzma University of the Pujab,Lahore, Pakistan

Extremal values of Topological Indices

Akelbek, Mahmud Weber State University

An Upper Bound on the Scrambling Index

Aleid, Sahar University of Almeria, Spain

Independent [1,2]-number versus independent domination number

Alhulwah, Khawlah Western Michigan University

A Generalization of Line graphs

Alomari, Omar The University of Jordan, Amman, Jordan

Semi Square Stable Graphs

Anderson, Mark Rollins College

A New Graph Recoloring Game

Angeleska, Angela University of Tampa

Coherent Network Partitions

Arman, Andrii University of Manitoba

The maximum number of cycles in a graph

Arora, A. Novi High School

Strong Matching Preclusion of Generalized Petersen Graphs

Asayama, Yoshihiro Yokohama National University

Polychromatic 4-coloring of an even-sided embedding

Asplund, John Dalton State College

Bounding Domination Invariants

Bahmanian, Amin Illinois State University

On The Existence of Generalized Designs

Bailey, Sean University of Southern Maine

Dot Product Graphs: Investigation of Extreme Dimensions

Balof, Barry Whitman College

Sigma Connectivity, Cographs, and Flower Graphs

Bandpey, Zeinab                              Morgan State University                   

Jonathan Farley's Mathematical Terror Theory: The Structure of Perfect Ter rorist Cells with a Single Leader                                                                                        

Banaian, Esther University of Minnesota

Multiplex Juggling and Generalized Eulerian Numbers

Bapat, Mukund University of Mumbai, India     

Some Vertex Prime Graph Families And A New Labeling Of Graphs

Barnes, Matt Louisiana State University

Unavoidable Immersions of 3-Edge-Connected Graphs

Barrus, Michael University of Rhode Island

Graphs with low Erdos-Gallai differences

Bass, Rachel Georgia Southern University

Functions of degrees and distances as graph invariants in trees

Battinelli, Catello Stonehill College

Weighted Distance-Two Edge-Balance Index Sets of Star Graphs

Baumbaugh, Travis Clemson University

Matroidal Structure of Skew Polynomial Root Sets

Beeler, Robert East Tennessee State University

Peg Duotaire - A Competitive Graph Parameter

Beilke, Julia Marquette University

Distance in the Graph Model of a Sudoku Grid

Benedetti, Bruno University of Miami

Constructing Manifolds from Trees of Simplices

Betten, Anton Colorado State University

Classifying Cubic Surfaces over a Finite Field

Beyerl, Jeffrey University of Central Arkansas

Recent Results on Improper Interval Graphs

Bhutani, Kiran The Catholic University of America

A Study of Domination Related Parameters in Graphs and their Applications

Bi, Zhenming Western Michigan University

Rainbow Hamiltonian-Connected Graphs

Birmajer, Daniel Nazareth College of Rochester

Compositions colored by simplicial polytopic numbers

Boats, Jeffe University of Detroit Mercy

Expected Value for Routable Disjoint Paths Given Random Terminal Selections

Boehme, Thomas

Technische Universitaet Ilmenau, Germany Geometric Representation of Graphs and Crossing Numbers

Bona, Miklos

University of Florida An overview of pattern avoiding permutations Something old, something new
Bona, Miklos University of Florida

Counting vertices in labeled rooted trees

Bowie, Miranda University of North Alabama

An Introduction to Set-sized Packing

Brandt, Axel Davidson College

Entire Colorability for a Class of Plane Graphs

Brown, David Utah State University

Interval k-Orders

Brown, Jason Dalhousie University

Recent Results on Chromatic Polynomials

Byers, Alexis Western Michigan University

Graceful Colorings of Graphs

Carrigan, Braxton Southern CT State University

Minimizing Positive Integer Sequences without Duplicate Substrings

Case, Benjamin Clemson University

Partial Domination in Graphs

Chan, Wai Hong The Education University of Hong Kong

Game Chromatic Index of K 6

Chi, Henjin Indiana State University

A Note on Total Chromatic Numbers of Graphs

Chopra, Dharam Wichita State University

On the Maximum Number of Constraints for some Balanced Arrays of Strength  Ten with Two Levels and Applications

Collins, Karen Wesleyan College

Counting split graphs, bipartite posets and adjacency matrices

Copenhaver, Keith University of Florida

k- protected and balanced vertices in unlabeled rooted plane trees

Couch, P. J. Lamar University

Thor Sequences

Cui, Guangqi Montgomery Blair High School

Monochromatic Rectangles in Grid Colorings

Curran, Stephen University of Pittsburgh at Johnstown

Enumerating Hamiltonian Paths in Cayley Digraphs on the Semidirect Product   of Cyclic Groups

D'Andrea, Joy University of South Florida

Connected Fundamental Transversals and Fundamental Transversal Domains

Davenport, Dennis Howard University

Zebra Trees

Davoudi, Anahitta University of Central Florida

Anomaly Detection in Social Networks

De Jesus, Jose University of Puerto Rico

On uniquely representable k-circular matroids

Defant, Colin University of Florida

Postorder Preimages

Defant, Colin University of Florida

Pattern-Avoiding Linear Extensions of Combs

Delgado, Moises University of Puerto Rico, Rio Piedras

Extensions of some Results on the Conjecture on Exceptional APN 
Functions and Absolutely Irreducible Polynomials: the Gold Case

Desmarais, Colin University of Manitoba

Constructions of hypergraphs free of certain 3-uniform 3-partite hypergraphs

Devereaux, Stephen Cornerstone University

On k-Rainbow Colorings in Graphs

Dod, Markus IVM Institut fur Vernetzte Mobilitat gGmbH

Counting fainbow pairs

Driscoll, Keith Clayton State University

On the 7-cordiality of trees

Dubczuk, Toni Illinois State University

The x-fold spectra of several multigraphs on 4 vertices with 6 edges and edge multiplicity at most 2

El-Zanati, Saad Illinois State University

On some cyclic and 1-rotational multigraph designs

Engen, Michael University of Florida

On the dimension of composition posets

Epstein, Michael Florida Atlantic University

Polynomial Lemniscate Configurations and Lemniscate Trees

Factor, Kim Marquette University

Restrained domination in directed graphs

Fallon, Joshua Louisiana State University

A family of 2-crossing-critical graphs on the projective plane

Feder, Elie Kingsborough Community College-CUNY

Maximum Rectilinear Crossing Numbers of Polyomino Graphs

Fenstermacher, Todd Clemson University

Tree Colorings of Graphs

Florkowski, Stanley Lehigh University

Non-disjoint Path Covering Number of Threshold Graphs

Fonseca, Carlos Kuwait University, Kuwait

New structural properties of trees with minimal atom-bond connectivity index

Fowler, Patrick University of Sheffield, UK

A graph-theoretical solution to a chemical problem: dominating sets and polyhedral  carbon-nitrogen cages

Fraboni, Michael Moravian College

The Birank Number of Operationally Constructed Graphs

Freyberg, Bryan Michigan Technological University

Constructing d-Handicap Tournaments

Froncek, Dalibor University of Minnesota Duluth

Products of Cycles Labeled by Cyclic Groups

Gaither, Jeffrey The Ohio State University

The Combinatorics of RNA-Protein Interactions

Gezek, Mustafa Michigan Technological University

Conterexamples to Hamada's conjecture

Gibson, Meghann Moriah Georgia Southern University

Combinatorics of n-Colored Cyclic Compositions

Gil, Juan Penn State, Altoona

On rational Dyck paths and factor-free Dyck words

Gismondi, Steve J. University of Guelph

Using Matching to Detect Infeasibility of Some Integer Programs

Godbole, Anant East Tennessee State University

Longest Common Patterns and Longest Increasing Subsequences

Grimaldi, Ralph Rose-Hulman Institute of Technology

Up-Down Ternary Strings

Gutierrez, Seth Georgia Southern University

On Gallai-Ramsey Numbers of Complete Bipartite Graphs

Hammer, James Cedar Crest College

Embedding Complete Multipartite Graphs into Smallest Dimension

Harborth, Heiko TU Braunschweig, Germany

Crossings of Pseudo Diagonals in Convex Polygons

Hart, Ian Western Michigan University

Majestic Colorings in Graphs

Hartnell, B. Saint Mary's University, Canada

Dominating a graph using both nodes and edges

Haynes, Teresa East Tennessee State University

Research Accomplishments of Prof. Peter J. Slater: A Tribute to Our Colleague and Dear Friend

Hedetniemi, Stephen Clemson University

Research Accomplishments of Prof. Peter J. Slater: A Tribute to Our Colleague and Dear Friend

Heinig, Monika Mount Sinai Health Systems

Cutting a Tree into a Forest: A Weighted Edge Algorithm

Heissan, A. M. Manhattanville College

An extension of Beineke to the Prototype Representation P(3, 1) and the infinite set of forbidden induced subgraphs

Heubach, Silvia California State University Los Angeles

New Results on Circular Nim

Hlavacek, Jan Saginaw Valley State University

The Signal Detection Problem: Closed Modular Colorings on Grid Graphs

Holliday, Sarah Kennesaw State University

Chromatic Villainy

Holmes, Amber Auburn University

The intersection problem for maximum packings of  6n+5

Homberger, Cheyne University of Maryland

Pattern Enumeration in the Separable Permutations

Honecker, Molly Florida Gulf Coast University

Universal Cycles of Graph Colorings

Hopkins, Brian Saint Peter's University

Color restricted n-color compositions

Horton, Steve West Point

Oriented Graceful Labelings of Trees

Huszar, Alana University of Michigan

4-Equitable Graphs

Irabor, Kehinde Marquette University

Change in the Dynamics of a Weighted Digraph via Eigenvalues

Isaak, Garth Lehigh University

Interval Orders with Length Bounds

Janwa, Heeralal University of Puerto Rico, Rio Piedras

BCH-like codes from extended Norm-Trace codes

Jeffries, Joel Tarkio High School

On 2-fold graceful labelings of graphs

Johnson, Peter Auburn University

Rainbow Connectivity in Certain Cayley Graphs

Kaneko, Yoshihiro Gifu University

Stable transmission trees on moving sinksof wireless sensor network

Karaoglu, Fatma University of Sussex

Cubic surfaces over F13

Kawasaki, Yuichiro Yokohama National University

Generating theorem for minor relations of quadrangulations with minimum degree at least 3 on the sphere

Kawatani, Gen Yokohama National University

Lower bound graphs of lattices and lattice transformations

Keller, Ariel Emory University

On Disjoint Cycles and Degree Conditions

Kemnitz, Arnfried Techn. Univ. Braunschweig, Germany

Bounds for the Sum Choice Number

Khodkar, Abdollah University of West Georgia

Signed edge domination numbers of complete tripartite graphs: Part Two

Kirkpatrick, Julie University of Northern Iowa

The x-fold spectra of several multigraphs on 4 vertices with 6 edges and edge 
multiplicity at most 2

Kischnick, Sara University of Applied Sciences Mittweida

Rainbow Colorings and Rainbow Dependent Sets

Knoll, Fiona Clemson University

Distributed Data Storage Systems via Graphs

Kreher, Donald Michigan Technological University

The Stars and Stripes Problem

Krop, Elliot Clayton State University

Vizing's conjecture: a two-thirds bound for claw-free graphs

Kruk, Serge Oakland University

Signal noise reduction via the cumulative spectral density

Krzywkowski, Marcin University of Johannesburg, South Africa

A characterization of trees with equal 2-domination and 2-independence nembers

Laaksonen, Antti Aalto University, Finland

Constructing Codes Using Transitive Permutation Groups

Lange, Thomas University of Applied Sciences Mittweida

Counting labeled Greg cacti and clique trees

Lanning, Charles Georgia Southern University

Pattern Containment in Circuler Permutaions

Laskar, Renu Clemson University

Resolvability Parameters of Graphs

Lefmann, Hanno Fakultaet fuer Informatik, TU Chemnitz, Germany

Edge Colorings of Hypergraphs Without A Fixed Rainbow Colored Subhyper- 
graph

Lichter, Tamar Queens College-CUNY

Maximum Rectilinear Crossing Numbers of Polyomino Graphs

Lipman, Drew Clemson University

Irredundant Colorings of Graph Products

Lipman, Mark J. Indiana University-Purdue University Fort Wayne

K8 is a Sphere-of-Influence Graph. K9 is not .

Low, Richard San Jose State University

The Integer-magic Spectra of the Cartesian Product of Two Trees

Lu, Xiaoyun US Census Bureau

On Min-max Pair in Tournaments

Lundberg, Erik Florida Atlantic University

The excedance set of a permutation: asymptotic enumeration

Magnant, Colton Georgia Southern University

Gallai-Ramsey numbers for finding a rainbow triangle or some small monochro matic subgraphs

Mahmoodian, E. S. Sharif University of Technology, Tehran

On decomposing complete tripartite graphs into 5-cycles

Malloulil, Fatma  University of Sfax, Tunisia

Iris Segmentation Based on EM Mixture of Gaussian Distribution

Marshall, Candice Morgan State University

Some Algebraic Structure of the Riordan Group

Matzke, Ryan University of Minnesota

Looking for the sum-freedom: The Maximum Size of (k, l)-sum-free Sets

McGinn, Donald University of West Florida

On completing partial Latin squares with two filled rows and at
least two filled columns

McKeown,James University of Miami

Waldspurger Matrices

Meerscheidt, Kyle University of Houston

A Class of Tricyclic Steiner Triple Systems

Merz, Sarah University of the Pacific

Minimum dominating sets that are separating

Milans, Kevin West Virginia University

Online coloring blowups of a known graph

Milz, Sebastian RWTH Aachen University

Degree complete graphs

Moghadam, Hosien Said University of Wisconsin, Osk Kosh

Compression Operator and Some Minimization Problems

Morra, Todd Clemson University

Generalizations of Independent Dominating Sets in Graphs

Moazzez, Babak Kennesaw State University

Integer Programming Approach to Static Monopolies in Graphs

Murphy, Kyle East Tennessee State University

2-Restricted Optimal Rubbling of Graphs

Myrvold, Wendy University of Victoria

Algorithms for Finding a Minimum Dominating Set

Myrvold, Wendy University of Victoria

Fun Problems for Planar Graphs

Nakamoto, Atsuhiro Yokohama National University

Rhombus tiling of even-sided polygons and quardangulations on the projective  plane

Narayan, Darren Rochester Institute of Technology

Towards a Characterization of Graphs with Distinct Betweenness Centralities

Noble, Matt Middle Georgia State University

Graph Dimension and a Quick Extremal Problem

Olejniczak, Drake Western Michigan University

A New Look at Bipartite Ramsey Numbers

Owens, Andrew Auburn University

Rainbow-Cycle-Forbidding Edge Colorings of Complete Multipartite Graphs,
with the Maximum Possible Number of Colors Appearing

Pantazi, Stefan Conestoga College Institute of Technology and Advanced Learning, Ontario, Cananda

Relations between consecutive Catalan monoids

Peres, Yuval Microsoft Reserach

Search games and optimal Kakeya sets

Peres, Yuval Microsoft Reserach

Random walks and typical distances in Ramanujan graphs, and the overhang problem

Perry, Katherine Auburn University

Rainbow Spanning Trees in Properly Edge-Colored Graphs

Perry, Sean Florida Atlantic University

Labelled Path Systems

Pimpasalee, Wannapol Khon Kaen University

On list backbone coloring of graphs

Pinciu, Val Southern Connecticut State University

Skewness, Colorings and Cliques

Pinero, Fernando University of Puerto Rico - Ponce

Some parameters of a class of codes on algebraic graphs

Porta, Gaspar Washburn University

Vizing-type bounds for graphs with forbidden induced subgraphs

Powers, Kelly Stonehill College

Distance-k Edge-Balance Index Sets of Extended Star Graphs

Qui, K. Brock University

Routing on the Hypercube with Blocking/Faulty Nodes

Reid, Michael University of Central Florida

Special Divisors of nk +1

Roberts, Dan Illinois Wesleyan University

On cyclic decompositions of complete digraphs into antidirected cycles

Robinson, Grant California State University, L.A.

Sequences of Integers with Three Missing Separations

Rubalcaba, Rob San Diego City College

Efficient Domination

Saccoman, John Seton Hall University

On a Class of Signless Laplacian Integral Multigraphs

Sawada, Joe University of Guelph, Canada

New successor rules for constructing De Bruijn sequences

Scheidweiler, Robert FH Aachen University of Applied Sciences

On Functions Inducing Proper Vertex Colorings Via Edge Weightings

Schiermeyer, Ingo Technische Universitat Bergakademie Freiberg, Germany

On the chromatic number of 2K2-free graphs

Schroder, Bernd S.W. The University of Southern Mississippi

Towards the Reconstruction of Decomposable Ordered Sets?

Scott, Paul Aaron Georgia Southern University

Modeling Dynamics of Gene Networks

Shahrokhi, Farhad University of North Texas

On largest reduced neighborhood clique cover number

Sharpe, Cameron University of Central Arkansas

Counting Graph Homomorphisms Involving Complete Graphs

Shull, Warren Emory University

On a Conjecture on Spanning Trees with few Branch Vertices

Sickman, Amy Illinois State University

The x-fold spectra of several multigraphs on 4 vertices with 6 edges and edge   multiplicity at most 2

Siddiqui, O. Detroit Country Day School

Strong Matching Preclusion of Arrangement Graphs

Sinko, Anne College of St. Benedict and St. John's University

Maximal and minimal chains of graph and hypergraph parameters

Sittitrai, Pongpat Khon Kaen University

Planer graphs without cycle of length 4 or 5 are (3, 5)-colorable

Smith, Brett Yale University

Treewidth Bounds for Planar Graphs

Soifer, Alexander University of Colorado, Colorado Springs

On Some Indiscretions of the Mathematical Community

Spiro, Sam University of Miami

Forbidden Configurations and Forbidden Families

Stinson, Douglas University of Waterloo

Optimal algebraic manipulation detection codes and difference families

Stucky, Eric University of Minnesota

Polynomial Chebyshev Quotients, Combinatorially

Su, Hsin-Hao Stonehill College

On Balance Index Sets of k-level Wheel Graphs

Suffel, Charles Stevens Institute of Technology

Excursions into Graph-theoretic Domination

Sullivan, Shaun Florida Gulf Coast University

A Variant on the Feline Josephus Problem

Szaniszlo, Zsuzsanna Valparaiso University

L(4, 3, 2, 1)-labeling of certain trees

Taniguchi, Hiroaki National Institute of Technology, Kagawa College

Dual Hyperovals from Commutative Presemifields

Tanny, Stephen University of Toronto

On the solution space of the Golomb recursion

Thas, Jef University of Gent, Belgium

Arcs, Caps and Codes: Old Results, New Results, Generalizations

Thomas, Brent University of Colorado, Denver

Saturation Number and Saturation Spectrum of Brooms

Todt, Heiko Stonehill College

On Edge-Balance Index Sets of L-Product of Cycles and Stars Connected by 
Leaves

Traetta, Tommaso Ryerson University

On f-pyramidal Steiner triple systems

Trenk, Anne Wellesley College

Finding Balance: Split Graphs and Related Classes

Tsaturian, Sergei University of Manitoba

A result in asymmetric Euclidean Ramsey theory

Vaidya, Sanju Mercy College, New York

Computation of Graph Vulnerability Measures and Topological Indices

van Trung, Tran University of Duisburg-Essen

Simple t-designs: recursive construction methods for arbitrary t

Vanloo, Gerard Morehouse College

Efficient Parallel Strategies for Hanoi Games

Vatter, Vincent University of Florida

Growth rates of permutations classes: from countable to uncountable

Wallace, Steven Middle Georgia State University

On combinatorial games and super tic-tac-toe

Wang, Hua Georgia Southern University

Pattern packing: questions and observations

Wang, Ping St. Francis Xavier University, Antigonish, Nova Scotia, Canada

Using Bipartite Networks to Construct Personal Recommendation Systems

Weiner, Michael Penn State, Altoona

On bounce-free rational lattice paths

Westlund, Erik Kennesaw State University

The Hall spectrum of a graph can have non-consecutive zeros

Wierman, John Johns Hopkins University

Strict inequalities between bond percolation thresholds of Archimedean lattices

Williams, Trevor Utah State University

The Game of Thrones

Woods, Angel Georgia Southern University

A survey of flow network applications

Yatauro, Michael Penn State - Brandywine

The Edge Cover Reliability Polynomial of a Graph

Young, Matthew Stonehill College

Weighted Distance-Two Edge-Balance Index Sets of Cycle Graphs

Zahedi, Emad Michigan State University

An Evolutionary Framework for Analyzing the Distance Preserving Property of Weighted Graphs

Zhang, Taoye Penn State University

   On 1-Hamiltonian line graphs of claw-free graphs

Zhou, Ju Kutztown University

A characterization of cycle-forced bipartite graphs

47th SEICCGTC ABSTRACTS                       

Abay-Asmerom, Ghidewon Virginia Commonwealth University

Spectral Features of Graphs Associated with the Geez Writing System

Abreu, Marien Universit`a degli Studi della Basilicata

Treelike Snarks

Adachi, Tomoko Toho University

Some construction of cluttered orderings for the complete bipartite graph

Ahmad, Uzma University of the Punjab,
New Campus, Lahore, Pakistan

On Automorphism Group Action and topological indices for Certain Families of Dendrimers

Arangno, Deborah Lenoir-Rhyne University

A Survey of LeRoy Beasley’s Work on Matrix Rank Comparison

Bailey, Sean Utah State University

Combinatorial Orthogonal Graphs

Barnett, Johnathan Auburn University

A Function Associated with the Hall Ratio

Bartha, Miklos Memorial University of Newfoundland

Zero-Reducible Graphs and the Konig Property

Beasley, LeRoy Utah State University

Clique Covering Numbers and Linear Preservers

Benjamin, Arthur Harvey Mudd College

Tiling with Fibonomials, q-binomials, and Chebyshev polynomials

Benjamin, Arthur Harvey Mudd College

Mathemagics: Secrets of Mental Math

Betten, Anton Colorado State University

Regular Packings in PG(3, 5)

Bickle, Allan Grand Valley State University

MegaMenger Graphs

Birmajer, Daniel Nazareth College of Rochester

On Restricted Words and Colored Compositions

Blackburn, Simon Royal Holloway University of London

Group-theoretic cryptography and the Algebraic Eraser

Blackburn, Simon Royal Holloway University of London

Non-overlapping codes

Bode, Jens-P TU Braunschweig

Linear Polyomino Achievement

Bozeman, Chassidy Iowa State University

Minimum Rank of Graphs with Loops

Brown, David Utah State University

Isolation Number, Boolean Rank, and the Duality Gap

Buelow, Zac Marquette University

  Cactus Based Out Tournament Adjacency Matrix Ranks

Burns, Jonathan University of South Florida

Counting the Patterns of DNA Rearrangement

Butler, Steve Iowa State University

Cycle Counting in an Infinite State Graph

Caliskan, Cafer Kadir Has University, Istanbul

New 2-edge-Balanced Graphs

Chan, Wai Hong H.Y. Lau, The Hong Kong Institute of Education

Cash Nim on three Piles

Cheng, Eddie Oakland University

Matching preclusion and conditional matching preclusion problems for the folded Petersen cube

Chi, Henjin Indiana State University

Total Chromatic Numbers of Graphs

Chia, Davin Middlebury College

Robustly Hosting Applications

Chopra, Dharam Wichita State University

Further Contributions to Factorial Designs of Resolution Ten and Balanced Arrays of Strength Nine

Christman, Ananya Middlebury College

Bin Packing with Multiple Colors

Churchill, Gregory University of South Florida

On Extending Hansel’s Theorem to Complete Hypergraphs

Conceicao, Ricardo Gettysburg College

On a Frobenius Problem for Polynomials

Couch, PJ Lamar University

  The Metamorphosis of 2-fold Triple Systems into Maximum Packings of 2Kn with

4-cycles

Cream, Megan Spelman College

Chorded Pancyclicity

Curran, Stephen University of Pittsburgh at Johnstown

Hamiltonian Circuits in Cayley Digraphs on Cyclic Groups

Dankelmann, Peter University of Johannesburg

The Edge-Connectivity of the Square of a Graph

Davoudi, Anahita University of Central Florida

Trust-Based Social Recommender Networks

Driscoll, Keith Clayton State University

On the 6-Cordiality of Trees

Droz, Daniel Penn State University

Counting Sets of Mutually Orthogonal Class-r Hypercubes

Dufour, Matthieu University of Quebec at Montreal

The *-Operator for Misère Subtraction Games

Durbin, Alexander Michigan State University

On the Roots of Tribonacci-type Polynomials

Dyer, Danny Memorial University of Newfoundland

Unique Watchman’s Walks

Dymacek, Wayne Washington and Lee University

Realizability of n-vertex graphs with prescribed vertex and edge connectivity and minimum and maximum degree II

Early, Edward Mathworks at Texas State University

On the Rank-unimodality of b-ary Partitions

Effinger, Gove Skidmore College

The Polynomial Euclidean Algorithm and the Linear Equation AX + BY = gcd(A, B)

Ellingham, Mark Vanderbilt University

Embeddings of Cartesian Products of Two Regular Graphs

Erickson, Lindsay Augustana University

The Regular and Misere form of Edge Nim on Trees

Fallon, Joshua Louisiana State University

Characterizing Almost-planar Graphs

Faria, Luerbio Universidade do Estado do Rio de Janeiro, Brasil

Well-covered Split Graph Characterization

Fenstermacher, Todd Clemson University

Edge Cut Domination in Graphs

Fernando, Neranga Northeastern University

Reversed Dickson Polynomials of the Third Kind

Ferrara, Michael University of Colorado Denver

Stability of the Potential Function

Ferrero, Daniela Texas State University

Component Connectivity of a Graph

Folts, Edward, III California State University, San Bernardino

Radio Number for Eighth Power Paths

Froncek, Dalibor University of Minnesota, Duluth

Regular Handicap Tournaments of Odd Order

Fry, Andy Colorado State University

The Abelian Sandpile Model and its Avalanche Polynomial

Fuller, Jessica Emory University

On (Kt − e)-Saturated Graphs

Gil, Juan Penn State University, Altoona

A connection between integer compositions and Dyck paths

Gomez-Calderon, Javier Penn State University

On the Ring of Algebraic Integers of Cyclotomic Subfields

Gould, Ronald Emory University

Degree Sum and Vertex Dominating Paths

Grez, Armando Iowa State University

New Upper Bounds on the Distance Domination Numbers of Grids

Grimaldi, Ralph Rose-Hulman Institute of Technology

Compositions with Descents at Odd Numbered Plus Signs

Gronau, Hans-Dietrich O.F. University of Rostock, German

A Problem in Extremal Set Theory

Hammer, James Cedar Crest College

Cycle Switching and Decompositions into Paths

Harborth, Heiko TU Brauschweig, Germany

Erdoes-Turan Type Numbers for Cube Graphs

Haxell, Penny University of Waterloo

Matchings in Hypergraphs

Haxell, Penny University of Waterloo

Edge Colouring Multigraphs

Haymaker, Katie Villanova University

Sums of subsets of GF(2r) and applications to the q-ary partial erasure channel

He, Qijun Clemson University

Data Identification for Unique Algebraic Model

Heissan, A. M.  Manhattenville College

An extension of Beineke to the Prototype Representation P(3, 1)

Heinig, Monika Stevens Institute of Technology

On Reliability Models Associated with the Edge Domination Number for Unicycles

Heubach, Silvia California State University, Los Angeles

  Keeping your Distance is Hard 

Heysse, Kristin Iowa State University

Cospectral Graphs for the Normalized Laplacian by “Toggling”

Hogben, Leslie Iowa State University 

Distance Spectra

Hogben, Leslie Iowa State University

Generalizations of the Strong Arnold Property and the Inverse Eigenvalue Problem of a Graph

Holliday, Sarah Kennesaw State University

Extreme Villainy

Hook, Jonelle Mount St. Mary’s University

Proper Diameter of Edge-Colored Graphs

Hossain, Gahangir Texas A&M University-Kingsville

Cognitive Resource Allocation Graph (CRAG): A Graph Representation of Human Cognitive Resources

Hosseini, Ehsanallah Bharati Vidyapeeth University

Dimension and Representation Number of Hypercube

Hui, Alice M. W. University of KwaZulu-Natal

Switched Subgraphs of the Symplectic Graph

Hurley, Michael Florida Atlantic University

New LS [3} [2, 3, 2 8 ] Geometric Large Sets

Isaak, Garth Lehigh University

Degrees and Trees

Isaak, Garth Lehigh University

Choose Multichoose

Janwa, Heeralal UPR-Cayey, UPR-Rio Piedras, Puerto Rico

Some New Results on the Conjecture on APN Functions and Absolutely Irreducible Polynomials

Johnson, Peter Auburn University

An Extremal Problem Concerning Vertex Covers

Joshi, Rucha Westwood High School, Austin Texas

Complexity of Finding Maximum Region Disjoint Paths in a Directed Graph

Kahl, Nathan Seton Hall University

On the Values of Independence Polynomials at  -1

Katz, Daniel California State University Northridge

A New Generating Function for Counting Zeroes of Polynomials

Kawasaki, Yuki Yokohama National University

N-flips and chromatic number in even triangulations on the projective plane

Kawatani, Gen Yokohama National University

Upper bound graphs of posets

Kelley, Christine University of Nebraska, Lincoln

Edge Spreading in Spatially-Coupled LDPC Codes

Kelm, J. Oakland University

Strong matching preclusion of (n, k)-star graphs

Kemnitz, Arnfried University of Braunschweig, Germany

Rainbow Connection Number Two and Clique Number

Kirkpatrick, Pamela Lehigh University

Graphs Obtained from Collections of d-Dimensional Blocks

Kischnick, Sara University of Applied Sciences Mittweida

Rainbow Partitions and Rainbow Polynomial

Knoll, Fiona Clemson University

Vertex-Cut Domination in Graphs

Krizan, Christopher Auburn University

Spectrum of the Szlam Numbers of the Plane

Kruk, Serge Oakland University

A Stock Analysis Turns Least-Squares Turns Maximum Cut of a Graph

Labbate, Domenico Universit`a degli Studi della Basilicata

Even orientations of graphs

Laffey, Tom University College Dublin, Ireland

On the Structure of Nonnegative Matrices with a Given Spectrum

Langley, Larry University of the Pacific

Mixed Unit Interval Graphs, 50% Tolerance Graphs, and Boolean Endpoints

Larsen, Victor Kennesaw State University

Combinatorial Nullstellensatz and Antimagic Labelings

Laskar, Renu Clemson University

Connectivity Parmeters in Graphs

Leach, David The University of West Georgia

Modular Leech Trees of Order at most 9

Lefmann, Hanno TU Chemnitz, Germany

Edge Colorings of Graphs Without Rainbow-Subgraphs

Leiss, Ernst University of Houston

Parallel Moves in Hanoi Games on Graphs: Every Parallel Hanoi Graph is a Sequential Hanoi Graph

Lichter, Tamar Queens College - CUNY

Maximum Rectilinear Crossing Number for Game Board Graphs

Lidicky, Bernard Iowa State University

Inducibility of Short Cycles

Lin, Jephian Iowa State University

Odd cycle zero forcing parameters and the minimum rank problem

Lipman, Drew Clemson University

Domination and Irredundance for Independence Systems

Lipman, Marc Indiana University-Purdue University Fort Wayne

Easy Luckless Graphical Minesweeper

Lorch, John Ball State University

Mutually Orthogonal Rectangular Gerechte Designs

Low, Richard San Jose State University

Friendly Index Sets of n-galaxies

Lueder, Tanya Louisiana Tech University

 A Characterization of Simple, K4 -Free Near Outer-Planar Graphs

Ma, Jianmin Colorado State University

The Distance Signatures of the Incidence Graphs of Affine Resolvable Designs

Machuca, Joanna California State University, San Bernardino

Radio Number for Eighth Power Paths

Maity, Soumen Indian Institute of Science Education and Research, Pune, India

Covering Arrays on Product Graphs

Martinez-Rivera, Xavier Iowa State University

Classification of families of pr- and epr-sequences

Masuda, Ariana New York City College of Technology

The Calkin-Wilf Tree

Matsumoto, Naoki Seikei University

Edge Rotations in Triangulations on the Sphere

McAdams, Stacey Louisiana Tech University

Oriented Book Embeddings

McGinn, Donald University of West Florida

Cordial Sets of Hypercubes

McGuire, Trevor North Dakota State University

Property-Preserving Poset Embeddings into Z n

Mendoza, Augustin California State University, San Bernardino

Radio Number for Eighth Power Paths

Merz, Sarah The University of the Pacific

The Competition Graph of a Local Tournament

Miranda, Lohans Federal University of Piaui

Permutations as solutions of linear Diophantine equations and magic squares

Moghadam, Hosien University of Wisconsin, Oshkosh

A Generalization of Edgesum Problem

Monfared, Keivan University of Calgary

Permanent ranks of matrices and generalized cycles of graphs

Moss, Kevin Iowa State University

Choosability with Union Separation

Mullen, Gary Penn State University

Some Open Problems Related to Finite Fields and Their Applications

Nevo, Aori Stevens Institute of Technology

Vertex degree condition for a 1-binding graph to contain a 1-factor

Novick, Beth Clemson University

Pebbling on a class of semilattices

O'Connell, Kelly Vanderbilt University

Multicoloured Containers and Graphon Entropy (Part I)

Opatrny, Jaroslav Concordia University, Montreal

Evacuation Problem: a Generalization of Search Problems

Orozco, Edusmildo University of Puerto Rico at Rio Piedras

On the solution of  J x α  =  J y β  and reduced  linear  modular systems

Ortiz-Ubarri, Jose University of Puerto Rico

Algebraic Symmetries of Generic Multidimensional Periodic Costas Arrays and their importance in the enumeration of Multidimensional Periodic Sonar Arrays

Pacheco, Natalia Univesity of Puerto Rico, Rio Piedras

Explicit Formulas for Monomial Involutions Over Finite Fields

Perry, Katherine Auburn University

Rainbow Spanning Trees in Edge-Colored Complete Graphs

Pinciu, Val Southern Connecticut State University

A Note on the Skewness of a Graph

Pohlmann, Brett Californai State University, Maritime Academy

Some Properties of Acyclic Heaps of Pieces

Pralat, Pawel Ryerson University

Almost All 5-Regular Graphs Have A 3-Flow

Reid, Michael University of Central Florida

Special Families of Prototiles

Roberts, Charles Indiana State University

Graphs Represented by Extended Diagonal Matrices

Ross, Dennis Michigan State University

Link Prediction in Graphs with Side Information

Rubio, Ivelisse University of Puerto Rico, Rio Piedras

Analysis of Multidimensional Periodic Arrays

Rucinski, Andrzej  Adam Mickiewicz University and Emory University

Refined Turan numbers and Ramsey numbers for the loose 3-uniform path of length three

Ryan, Kathleen DeSales University

Degree Sequences of Partial 2-trees

Saccoman, John Seton Hall University

A Spanning -Tree Increasing Surgery for Proper Threshold Graphs

Salaam, Lifoma

Howard University

Non-Crossing Partitions in Binary, Ordered and Motzkin Trees

Schiermeyer, Ingo

Technische Universitat Bergakademie Freiberg, Germany

Chromatic number of P5-free graphs: x-binding functions

Schluchter, Steven George Mason University

Prime Labelings of Generalized Petersen Graphs and Large Cubic Bipartite Graphs

Schulte, Alex Iowa State University

Unitary Anti-Van der Waerden Number of Arithmetic Progressions

Schultz, Kristian University Rostock

Maximal Size of Sperner Families with a 3-Union Condition

Sears, Lewis Washington and Lee University

Realizability of n-vertex graphs with prescribed vertex and edge connectivity and minimum and maximum degree III

Shahrokhi, Farhad University of North Texas

k-domination in the Intersection Graph of Geometric Objects

Sharma, U. Rochester High School

Hamiltonian Laceability in Cubic Bipartite Graphs

Simmons, Gustavus  

Hamilton-Laceable Properties of Polygonal bigraphs

Smith, Stephen University of Memphis

The Poset on Connected Graphs is Sperner

Snider, Lauren McNeese State University

Some Bicyclic Antiautomorphisms of Mendelsohn Triple Systems

Soifer, Alexander  University of Colorado, Colorado Springs

The Scholar and the State: From the Third Reich to Today in Fool’s Gold of Silence 

Stevens, Gary Hartwick College

Palindromes with Forbidden Substrings

Stromberg, Johanna Vanderbilt University

Multicoloured Containers and Graphon Entropy (Part II)

Suffel, Charles Stevens Institute of Technology

On Reliability Models Associated with the Edge Domination Number for Trees

Sun, Alex Jialong Sacremento Waldorf School

2-steps Hamiltonian graphs Of Line Graphs Of Open Trees of Cycles

Szwarcfiter, Jayme Luiz                     Federal University of Rio de Janeiro, Brazil                       

Graph Convexity Parameters: Complexity and Applications

Tanny, Stephen University of Toronto

Non-Monotonic Solutions to Nested Recursions: A Combinatorial Approach

Tapia-Recillas, H. Dpto. de Mathematicas, Univ. Autonoma Metropolitana-I, Mexico D.F.

A secret sharing scheme based on the polynomial ring over a finite field

Thomas, Brent University of Colorado, Denver

Saturation Spectrum of Trees

Tiner, Gary Faulkner University

On the Erdos-Sos Conjecture for graphs with diameter at most k + 2

Traetta, Tommaso Ryerson University

Unparalleled even cycle systems

Tzanakis, Georgios Carleton University

Constructing Covering Arrays from m-Sequences

Vaidya, Sanju Mercy College

Bounds for Topological Indices of Molecular Graphs

Valera, Leobardo University of Texas, El Paso

Introduction to Pairwise Testing. Definition and Examples

Vandell, Chip Indiana University - Purdue University Fort Wayne

Decycling Toeplitz Graphs, Some Subgraphs, and Generalized Petersen Graphs

Villalpando, John California Lutheran University

Trees for Given Values of the Span, Caps and Icaps for L(2, 1)-Colorings

Vince, Andrew University of Florida

Counting Connected Sets and Connected Partitions of a Graph

Voigt, Margit University of Applied Sciences Dresden

 Sum choice number of generalized  0-graphs

Wang, Qiang Carleton University

Partitions and compositions over finite fields

Wang, Shaohui The University of Mississippi

On the Ratio of Domination and Independent Domination Number

Ward, Jackson Illinois State University

Spectrum problem for multigraph designs on four vertices and eight edges

Wehrung, Ben Jacksonville University

When You Need a Quasigroup with a Hole of Size 4, 6, or 8

Wei, Ruizhong Lakehead University

Pandiagonal Multimagic Squares Based on Large Sets of Orthogonal Arrays

Weiner, Michael Penn State, Altoona

From Dyck Paths Colored by Connected Matchings to Standard Young Tableau

Wierman, John John Hopkins University

Rigorous bounds relating bond percolation thresholds of two three-dimensional lattices

Williams, Ryn Colorado State University

Knitting Numbers

Yahyaei, Laleh S. P. Pune University

Dimension of a Lobster

Yatauro, Robert   Penn State-Brandywine

Uniform Optimality Results for Unicycles in the Neighbor Component Order  Edge Connectivity Network Model

Yonekura, Shinichi  Yokohama National University

Quadrangulations on the projective plane with K3,4-minors

Young, Derek  Iowa State University

Lower Bounds for the Exponential Domination Number of Cm × Cn

Yu, Gaoran John Hopkins University

Exact Enumeration of Self-Avoiding Walks on Non-vertex-transitive Lattices

 Yu, Gexin  College of William and Mary

Relaxed Coloring of Planar Graphs

Yu, Xingxing

Georgia Institute of Technology

On the Kelmans-Seymour conjecture