48th Southeastern International Conference on Combinatorics, Graph Theory & Computing

March 6-10, 2017

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 ₆
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 K _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 F₁₃
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 n^k +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 2K₂-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

Abstracts, 2016
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 ⁸ ] 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
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
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

Additional Information

The Charles E. Schmidt College of Science offers unparalleled experiential learning opportunities to prepare the next generation of scientists and problem solvers.

Get More Info Apply Now

Address

Charles E. Schmidt College of Science

Florida Atlantic University

777 Glades Rd, SE-43

Boca Raton, FL 33431

Phone: (561) 297-3035

Fax: (561) 297-3292

View our multiple campus locations and contacts.