Combinatorics, Graph Theory and Computing

This proceedings volume compiles selected, revised papers presented at the 54th Southeastern International Conference on Combinatorics, Graph Theory, and Computing (SEICCGTC 2023), which took place at Florida Atlantic University in Boca Raton, USA, from March 6th to 10th, 2023.

The SEICCGTC is widely regarded as a trendsetter for other conferences worldwide. Many ideas and themes initially discussed here have subsequently been explored in other conferences and symposia.

Since 1970, the conference has been held annually in Baton Rouge, Louisiana, and Boca Raton, Florida. Over the years, it has grown to become the primary annual conference in its fields, playing a crucial role in disseminating results and fostering collaborative work.

This volume is tailored for the community of pure and applied mathematicians in academia, industry, and government, who work in combinatorics and graph theory, as well as related areas of computer science and the intersections among these fields.

Explores cutting-edge research in combinatorics and graph theory Presents insights from leading experts in mathematics and computer science Proposes innovative solutions for real-world challenges

Auteur

Frederick Hoffman is a Professor at the Florida Atlantic University, USA. He holds a PhD in Mathematics from the University of Virginia (1964). His research interests lie in finite groups, combinatorics and applications, and artificial intelligence.

Sarah Heuss is an Instructor/Adjunct Professor at the University of South Carolina Union, USA. She holds a PhD in Mathematics from Auburn University (2003). Dr. Heuss has also served as a Secretary of the Institute of Combinatorics and its Applications (ICA).

Richard Low is a Lecturer at the San José State University, USA. He holds a PhD in Mathematics from Western Michigan University (1998). His research interests include combinatorics, group theory, and cryptology.

John C. Wierman is an Emeritus Professor of Applied Mathematics and Statistics, having served at John Hopkins University, Whiting School of Engineering, USA. He received his PhD in Mathematics from the University of Washington (1976). Dr. Wierman's research focuses on probability, stochastic processes, statistics, discrete mathematics, percolation theory, and random graphs.

Contenu

1 Constraint Programming Generation of Optimal Balanced Incomplete Block Design.- 2 Some Remarks on Fibonacci-type Recursive Polynomials.- 3 Survival Probabilities of Counting-Out Games on a Line.- 4 Intersection of Longest Cycle and Largest Bond in 3-Connected Graphs.- 5 Characterizing Minimally 3-Connected Graphs.- 6 Properties of Pancentral and Related Graphs.- 7 The Gathering Number of a Graph and Vertex Degrees.- 8 Complete Multipartite Graphs are Pansophical.- 9 Superuser Pansophy.- 10 The Conclusion to the Edge-Balance Index Set Problem for Complete Bipartite Graphs.- 11 On Tight 6-Cycle Decompositions of Complete 3-Uniform Multi-Hypergraphs.- 12 An Extension of Seymour's Second Neighborhood Conjecture.- 13 k-Domination in Cartesian Product of Complete Graphs.- 14 On Irregular Domination in Graphs.- 15 Cop Numbers of Periodic Graphs.- 16 Euler's Formula for General Graph Embeddings.- 17 Ramsey Theory in Mathematical Olympiad and Nesting Parallelepipeds.- 18 Geometric Parameters of Bipartite Suspensions.