LEADER 05471nam 22007935 450 001 996490346803316 005 20240221154750.0 010 $a9783031053757$b(electronic bk.) 010 $z9783031053740 024 7 $a10.1007/978-3-031-05375-7 035 $a(MiAaPQ)EBC7085015 035 $a(Au-PeEL)EBL7085015 035 $a(CKB)24819554500041 035 $a(DE-He213)978-3-031-05375-7 035 $a(PPN)264955854 035 $a(EXLCZ)9924819554500041 100 $a20220913d2022 u| 0 101 0 $aeng 135 $aurcnu|||||||| 181 $ctxt$2rdacontent 182 $cc$2rdamedia 183 $acr$2rdacarrier 200 10$aCombinatorics, Graph Theory and Computing$b[electronic resource] $eSEICCGTC 2020, Boca Raton, USA, March 9?13 /$fedited by Frederick Hoffman 205 $a1st ed. 2022. 210 1$aCham :$cSpringer International Publishing :$cImprint: Springer,$d2022. 215 $a1 online resource (327 pages) 225 1 $aSpringer Proceedings in Mathematics & Statistics,$x2194-1017 ;$v388 311 08$aPrint version: Hoffman, Frederick Combinatorics, Graph Theory and Computing Cham : Springer International Publishing AG,c2022 9783031053740 327 $aRatio Balancing Numbers(Bartz et al) -- An Unexpected Digit Permutation from Multiplying in any Number Base(Qu et al) -- A & Z Sequences for Double Riordan Arrays (Branch et al) -- Constructing Clifford Algebras for Windmill and Dutch Windmill Graphs; A New Proof of The Friendship Theorem(Myers) -- Finding Exact Values of a Character Sum (Peart et al) -- On Minimum Index Stanton 4-cycle Designs (Bunge et al) -- k-Plane Matroids and Whiteley?s Flattening Conjectures (Servatius et al) -- Bounding the edge cover of a hypergraph (Shahrokhi) -- A Generalization on Neighborhood Representatives (Holliday) -- Harmonious Labelings of Disconnected Graphs involving Cycles and Multiple Components Consisting of Starlike Trees(Abueida et al) -- On Rainbow Mean Colorings of Trees (Hallas et al) -- Examples of Edge Critical Graphs in Peg Solitaire (Beeler et al) -- Regular Tournaments with Minimum Split Domination Number and Cycle Extendability (Factor et al) -- Independence and Domination of Chess Pieces on Triangular Boards and on the Surface of a Tetrahedron(Munger et al) -- Efficient and Non-efficient Domination of Z-stacked Archimedean Lattices (Paskowitz et al) -- On subdivision graphs which are 2-steps Hamiltonian graphs and hereditary non 2-steps Hamiltonian graphs (Lee et al) -- On the Erd}os-S_os Conjecture for graphs with circumference at most k + 1 (Heissan et al) -- Regular graph and some vertex-deleted subgraph (Egawa et al) -- Connectivity and Extendability in Digraphs (Beasle) -- On the extraconnectivity of arrangement graphs (Cheng et al) -- k-Paths of k-Trees(Bickle) -- Rearrangement of the Simple Random Walk(Skyers et al) -- On the Energy of Transposition Graphs(DeDeo) -- A Smaller Upper Bound for the (4; 82) Lattice Site Percolation Threshold(Wierman). 330 $aThis proceedings volume gathers selected, revised papers presented at the 51st Southeastern International Conference on Combinatorics, Graph Theory and Computing (SEICCGTC 2020), held at Florida Atlantic University in Boca Raton, USA, on March 9-13, 2020. The SEICCGTC is broadly considered to be a trendsetter for other conferences around the world ? many of the ideas and themes first discussed at it have subsequently been explored at other conferences and symposia. The conference has been held annually since 1970, in Baton Rouge, Louisiana and Boca Raton, Florida. Over the years, it has grown to become the major annual conference in its field, and plays a major role in disseminating results and in fostering collaborative work. This volume is intended for the community of pure and applied mathematicians, in academia, industry and government, working in combinatorics and graph theory, as well as related areas of computer science and the interactions among these fields. 410 0$aSpringer Proceedings in Mathematics & Statistics,$x2194-1017 ;$v388 606 $aDiscrete mathematics 606 $aGraph theory 606 $aAlgebraic fields 606 $aPolynomials 606 $aComputer science$xMathematics 606 $aConvex geometry 606 $aDiscrete geometry 606 $aDiscrete Mathematics 606 $aGraph Theory 606 $aField Theory and Polynomials 606 $aDiscrete Mathematics in Computer Science 606 $aConvex and Discrete Geometry 606 $aAnàlisi combinatòria$2thub 606 $aTeoria de grafs$2thub 608 $aCongressos$2thub 608 $aLlibres electrònics$2thub 615 0$aDiscrete mathematics. 615 0$aGraph theory. 615 0$aAlgebraic fields. 615 0$aPolynomials. 615 0$aComputer science$xMathematics. 615 0$aConvex geometry. 615 0$aDiscrete geometry. 615 14$aDiscrete Mathematics. 615 24$aGraph Theory. 615 24$aField Theory and Polynomials. 615 24$aDiscrete Mathematics in Computer Science. 615 24$aConvex and Discrete Geometry. 615 7$aAnàlisi combinatòria 615 7$aTeoria de grafs 676 $a511.6 702 $aHoffman$b Frederick$f1937- 801 0$bMiAaPQ 801 1$bMiAaPQ 801 2$bMiAaPQ 912 $a996490346803316 996 $aCombinatorics, graph theory and computing$93008866 997 $aUNISA